Dijkstra’s shortest path algorithm

LOOK INSIDE

An efficient algorithm to find the shortest path between two nodes within a network of any size.
Three versions, all using the same approach:
1. A “luxury” version with labels and named nodes.
2. A “bare bones” version taking numbered nodes and links as input.
3. A version that will find shortest paths from one node to all nodes.