It is the source code of the Floyd-Warshall algorithm for finding the shortest path between all nodes. The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal

Floyd-Warshall algorithm for shortest path problem

Floyd–Warshall algorithm

本实例采用Warshall-Floyd算法求赋权图中任意两点间的最短路径-This example uses Warshall-Floyd algorithm weight graphs the shortest path between any two points