Shortest path algorithms

Algorithms for finding the shortest path between two nodes in a graph, such as Dijkstra's algorithm or the Bellman-Ford algorithm.