“…Notice that SSPF-R finds that cable deletions in the sequence from ((9, 6), 2) to ((4, 5), 1) in Q are optimal and thus, the Best_Q equals Q. For ((4, 6), 1), Step 2 sets n 46 =1+1=2, and argmax in Step 3 selects (0, 3), which affect P 3 =((0, 3), (3,6)) that was generated in SSPF-1. Thus, GH-Flow() generates a new path P 3 =((0, 1), (1,4), (4,6)) that has sufficient capacity to route demand 3.…”