为您提供一个简单的方法来创建基于Dijkstra算法的距离表。
Dijkstra's algorithm, conceived by computer scientist Edsger Dijkstra is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.
The app displays the result in a distance table.