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

Figure 8

Transient behaviors of , , and (edges belonging to the SP) and and (edges which do not belong to the SP). This plot is obtained as a solution of (10a) and (10b) for the application example in Figure 4 under the same initial values as in Figure 7 coming from reference to [42].