Optimizing the Cyclic K-conflict-free Shortest Path Problem in a Network-on-chip : Figure 3

Figure 3: An ACG (a), and two maximum traffic flow configurations (b-c).