A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Figure 3

Flowchart revealing the functioning principle of the NAOP simulator for shortest path detection in dynamically reconfigurable graphs. This flowchart is valid for all graphs. The rule for updating alpha and beta is defined according to the expression in (15) (i.e., ).