- 1 (106.08 KiB) Viewed 45 times
Problem 1 [10 marks] Consider the network flow instance (G, c) on the left and s-t flow f on the right. น U 8 6 8 S 5 es
-
correctanswer
- Posts: 43759
- Joined: Sat Aug 07, 2021 7:38 am
Problem 1 [10 marks] Consider the network flow instance (G, c) on the left and s-t flow f on the right. น U 8 6 8 S 5 es
Problem 1 [10 marks] Consider the network flow instance (G, c) on the left and s-t flow f on the right. น U 8 6 8 S 5 es 10 5 2 3 3 3 V V 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.