So let's define the weight P sub V of a vertex V from the original graph, that is one of the six vertices in this example that we started with, as the shortest path distance we just computed from the extra vertex S to that vertex V. 