Dynamic Path Optimization with Real-Time Information for Emergency Evacuation

Algorithm 1

Offline evacuation path optimization.

	create vertex set Q
	for each vertex in Graph:
	dist []  ⟵  Infinity
	path []  ⟵  Undefined
	add to Q
	dist [source]  ⟵  0
	while Q is not empty:
	⟵  vertex in Q with min dist []
	remove from Q
	for each neighbor of u:
	expand  ⟵  dist [] + length (, )
	if expand < dist []:
	dist []  ⟵  expand
	path []  ⟵
	return dist [], path []