Floyd-Warshall (All-Pairs)

Computes shortest paths between every pair of vertices by progressively allowing more intermediate vertices.