Floyd-Warshall
O(V³). Simple triple loop. Best for dense small V.
Advertisement
Johnson
Reweight + V Dijkstras. O(V·E log V + VE). Best for sparse graphs.
Advertisement
Seidel
Undirected unweighted: O(V^ω · log V) via matrix multiplication. ω ≈ 2.37.