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.