Floyd-Warshall Algorithm

Finds shortest paths between all pairs of vertices in a weighted graph, including those with negative edges (but no negative cycles).