Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
Algorithm for finding shortest and widest paths in a weighted graph
AURA - Adaptive Unified Routing Algorithms: A modern ES package providing graph shortest-path algorithms (Aura, Dijkstra, A*).
Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.