And it also tells us how to compute the shortest path distance and the shortest path from S to V, namely in the A array, we just write down what was the greedy, the Dijkstra's greedy score for this particular edge, and that was zero plus one, or one. 