dijkstra

Shortest Paths: Dijkstra, Bellman-Ford, Floyd-Warshall

Three algorithms, three different jobs. Which one to reach for depends on negative edges, on how many sources you have, and on nothing else.

Problem Solving From Zero14