Works in two major stages which are repeated and coordinated
by the setting of a global state (set by the master compute class)
Stage 1: Discover shortest paths, and shortest path counts for each source vertex in a globally set pivot batch to each node in the graph.
Stage 2: Accumulate pair dependencies.