Python, Graph, Algorithms.
3.3. Floyd-Warshall Algorithm The Floyd-Warshall algorithm is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but no negative cycles). A single execution of the algorithm will find the lengths (summed weights) of the shortest paths between all