Question

Question 4 (20 marks) Let N be the network below, where ax and y are the source and sink respectively, and the arc S capacities are shown next to each arc. An initial flow of this network is given in parentheses 3(0) 6(0) 5(0) 4(0) 3(1) 2(0) X 2(1) 2(0) 3(1), 5(1) 4(0) 2(2) 2.5(1) V Starting from the given flow, use the labelling algorithm to find a maximum flow in N. Show every stage of the algorithm. State the value of the maximum flow, and give the minimum cut that comes out of the algorithm

Answer 1

Netioonke low Given a 3lo) 2a 3CD 50) Sinke 5W 2.50) All pahs fem S to illhave ac in He cut. st ot am Cs,3) b, u, v) (a,d, e) ca,b) d4) cex) CS3) al a

Addeflow lonsa on ebro 9 jes ies es) kes ies i esje ies jes Kies es jeE ke ies Ca, b,c,d u, v) auoss Cs, St2-4 |