Shortest paths

Apply Dijkstra's algorithm to a weighted graph.

One step at a time. Answers stay hidden until you have had a go.