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.
Last updated on Oct 12, 2015
이 버전에는 사소한 버그 수정과 전반적인 개선 사항이 포함되어 있습니다. 최상의 환경을 위해 최신 버전으로 업데이트하세요.
