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.
9Apps 4.9
![[DEV] Dijkstra Visualization App (Remaking the graphics) P.3 screenshot 2](https://i.ytimg.com/vi/n26rH9WtRBs/mqdefault.jpg)
