Introduction - If you have any usage issues, please Google them yourself
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