So, if we have a birdseye view of the network in principle, we can figure out the distance between any pair of vertices algorithmically by simply looking at the global map and figuring out what the shortest path is. 