Dijkstra’s Algorithm — The First Look
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes.
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading1:
Dijkstra’s algorithm is one of the most widely used methods for finding single-source shortest paths in a simple digraph. In other words, Dijkstra’s algorithm determines the shortest paths from a common ...