Building graph of minimal distances
Graph of minimal distances
The graph of minimal distances is a graph which weight of the arch between two vertexes equals the minimal distance between the vertexes of the initial graph. An adjacency matrix of the graph of the minimal distances will be the matrix of the minimal distances of the initial graph.
We use the Floyd–Warshall algorithm to find minimal distances between all the pairs of vertexes. https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm.
How to use Floyd–Warshall algorithm
- Choose “Algorithms” in the menu bar and then “The Floyd–Warshall algorithm”.
- If you want to work with a distance matrix, then push “Show distance matrix” button.
- If you wish to save the result, then put a tick near the text “Press for saving”.