With positive weights, the path that Dijkstra’s algorithm takes to visit each node for the first time is truly the shortest. It’s easiest to see that this is true for the very first step. Imagine two ...