Research Article
Dynamic Path Optimization with Real-Time Information for Emergency Evacuation
Algorithm 2
Online dynamic path optimization.
| | for p in PNet | | | for d in | | | if path p contains node d | | | the first node of path p | | | forin | | | is updated by the breadth-first search algorithm | | | forin | | | update the path ofas | | | for p in | | | for in path p | | | p check the nodes aroundwhether p is the shortest | | | return |
|