1. Use Ford-Fulkerson algorithm to solve the max-flow problem based on the following network where the...

   

Transcribed Image Text:

1. Use Ford-Fulkerson algorithm to solve the max-flow problem based on the following network where the capacity of each edge has been labeled. Draw, separately, the residual graph when you cannot find any augmenting path any more (i.e., when Ford-Fulkerson algorithm stops). Draw the max-flow on the original graph below, i.e., write down the flow for all the edges after running Ford-Fulkerson. Answer what the max-flow quantity v(f) is for this network. S 12 10 3 b 00 (O 10 8 (1) e 10 15 1. Use Ford-Fulkerson algorithm to solve the max-flow problem based on the following network where the capacity of each edge has been labeled. Draw, separately, the residual graph when you cannot find any augmenting path any more (i.e., when Ford-Fulkerson algorithm stops). Draw the max-flow on the original graph below, i.e., write down the flow for all the edges after running Ford-Fulkerson. Answer what the max-flow quantity v(f) is for this network. S 12 10 3 b 00 (O 10 8 (1) e 10 15