Dijkstra's Algorithm
Dijkstra's algorithm solves the single-source shortest paths problem on
Bellman-Ford Algorithm
Bellman-Ford solves the single-source shortest paths problem on a
Floyd's Algorithm
Also known as the Floyd-Warshall algorithm.
SPFA (Shortest Path Faster Algorithm)
SPFA is a queue-based refinement of Bellman-Ford. Instead of relaxing