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
Question image 1