DMGA: A Distributed Shortest Path Algorithm for Multistage Graph

Figure 3

Two graph partitioning strategies. (a) Edge-cut strategy. (b) Vertex-cut strategy.

(a)

(b)