Optimization:

d(3)10 d(6) d(7) 0 source U 12 37 35 12 d(2) d(5) Compute the distance labels on the network above. Use the Shortest Augmenting Path to finish the first update and then find two additional updates for finding the max flow from 1 to 7 d3 Advance: 1-2-5-7 Augmentunits along path Advance 1-2, retreat, relabel vertex 2: d(2) 44) 42- Update 2 Advance: Augmentunits along path Advance relabel vertex-: d( )=-- di6)- , retreat, , retreat, , retreat, Advance relabel vertex-: d( ) Advance 05r relabel vertex-: d( ) = -- 06 Update 3 Advance: Augment_units along path Advance relabel vertex : d( ) =-- , retreat, 2 dSP