DMGA: A Distributed Shortest Path Algorithm for Multistage Graph

Algorithm 4

Global shortest path calculation.

	Require: The local shortest paths of each partition
	Ensure: The global shortest path and its cost
(1)
(2)	for to do all computing nodes do in parallel
(3)
(4)
(5)	end for
(6)	while do
(7)	for all do all computing nodes do in parallel
(8)	sends to
(9)	end for
(10)	for all do all computing nodes do in parallel
(11)	for all do
(12)	for all do
(13)	if then
(14)	if then
(15)
(16)
(17)
(18)	else if then
(19)
(20)
(21)	Update with the new value
(22)	end if
(23)	end if
(24)	end for
(25)	end for
(26)
(27)
(28)	end for
(29)
(30)	end while
(31)	returns