Floyd-Warshall Alhorithm

The Floyd-Warshall algorithm compares all possible paths through the graph between each pairs of vertices. The problem is to find the shortest distances between every pair of vertices in a given edge weighted Graph.