당신에게 다 익스트라 알고리즘을 기반으로 거리 테이블을 만들 수있는 쉬운 방법을 제공합니다.
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.