#dijkstra

Shortest Paths (Dijkstra, Bellman-Ford, BFS)

Pick the right shortest-path algorithm: BFS for unweighted graphs, Dijkstra for non-negative weights, Bellman-Ford for negative edges — with every gotcha.