Question
Ꮖ 4. The following network N has source x and sink y with arc capacities as shown. An initial flow of this network is given in parentheses. Starting from this flow, use the labelling algorithm to find a maximum flow and a minimum cut in N. In each iteration of the algorithm, you are required to label all vertices that can be labelled. Show every stage of the algorithm, state explicitly the value of the maximum flow found, and give explicitly the minimum cut found and its capacity. [8 marks] 1
Question image 1