Single-Source Shortest Paths: Dijkstra, Bellman-Ford and DAGs
The single-source shortest-paths problem asks for a shortest path from a source s to every vertex of a weighted directed graph.
Algorithms · topic
Shortest paths
Relaxation, Dijkstra and why negative edges break it, Bellman-Ford with negative-cycle detection, shortest and longest paths in a DAG, Floyd-Warshall, BFS for unweighted graphs and a complexity table by representation and data structure.
Study this topic
All-Pairs Shortest Paths: Floyd-Warshall
The all-pairs shortest-paths problem asks for δ(i,j) for every pair of vertices.
Shortest paths cheat sheets
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.