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

Figure 12

Topology of a directed graph of magnitude 5 and size 8. Both costs and states of edges are denoted, respectively, by and (this figure is considered in [41]).