Consider the network flow instance (G, c) on the left and s-t flow f on the right. U U 5 8 5 Co t 1 Ot 3 c: EZ+ (edge ca

[correctanswer]

Consider The Network Flow Instance G C On The Left And S T Flow F On The Right U U 5 8 5 Co T 1 Ot 3 C Ez Edge Ca 1 (338.6 KiB) Viewed 166 times

Consider the network flow instance (G, c) on the left and s-t flow f on the right. U U 5 8 5 Co t 1 Ot 3 c: EZ+ (edge capacities) f: EZ+ (current flow) Your task is to run one iteration of the Ford-Fulkerson algorithm: (a) Specify the augmenting path used to update the current flow. (b) Specify the value of the updated flow. (c) Specify a minimum cut and the capacity of the minimum cut. (d) Use the updated flow to justify that the cut described in part (c) is a minimum cut. S 2 S O