Consider the following flow network, with no initial flow along the graph. 0/4 Do the following....

  

Transcribed Image Text:

Consider the following flow network, with no initial flow along the graph. 0/4 Do the following. 0/7 0/6 B 0/1 D 0/5 0/3 0/9 E 0/10 0/2 (a) Consider the flow-augmenting path s→BDt. Push as much flow through the flow-augmenting path and draw the updated flow network below. (b) Find a flow-augmenting path using the updated flow configuration from part (a). Then do the following: (i) clearly identify both the flow-augmenting path and the maximum amount of flow that can be pushed through said path; and then (ii) push as much flow through the flow-augmenting path and draw the updated Blow network below. Answer. (c) Find a flow-augmenting path using the updated flow configuration from part (b). Then do the following: (i) clearly identify both the flow-augmenting path and the maximum amount of flow that can be pushed through said path; and then (ii) push as much flow through the flow-augmenting path and draw the updated flow network below. (d) Using the flow configuration from part (c), finish executing the Ford Fulkerson algorithm. Include the following here: (i) your flow network, reflecting the maximum-valued flow configuration you found, and (ii) the corresponding minimum capacity cut. There may be multiple minimum capacity cuts, but you should identify the one corresponding to your maximum-valued flow configuration. Then (iii) finally, compare the value of your flow to the capacity of the cut. Note: You do not need to include the remaining steps of the Ford Fulkerson algorithm. We will not check these steps when grading. Answer. Consider the following flow network, with no initial flow along the graph. 0/4 Do the following. 0/7 0/6 B 0/1 D 0/5 0/3 0/9 E 0/10 0/2 (a) Consider the flow-augmenting path s→BDt. Push as much flow through the flow-augmenting path and draw the updated flow network below. (b) Find a flow-augmenting path using the updated flow configuration from part (a). Then do the following: (i) clearly identify both the flow-augmenting path and the maximum amount of flow that can be pushed through said path; and then (ii) push as much flow through the flow-augmenting path and draw the updated Blow network below. Answer. (c) Find a flow-augmenting path using the updated flow configuration from part (b). Then do the following: (i) clearly identify both the flow-augmenting path and the maximum amount of flow that can be pushed through said path; and then (ii) push as much flow through the flow-augmenting path and draw the updated flow network below. (d) Using the flow configuration from part (c), finish executing the Ford Fulkerson algorithm. Include the following here: (i) your flow network, reflecting the maximum-valued flow configuration you found, and (ii) the corresponding minimum capacity cut. There may be multiple minimum capacity cuts, but you should identify the one corresponding to your maximum-valued flow configuration. Then (iii) finally, compare the value of your flow to the capacity of the cut. Note: You do not need to include the remaining steps of the Ford Fulkerson algorithm. We will not check these steps when grading. Answer.