Flows and Linear Programming Duality
Max-flow min-cut, the algorithms that realise it, and the linear programming duality that explains every min–max theorem here.0/14 masteredAn arc (u,v) has capacity 7 and carries f(u,v)=4, while the reverse arc carries f(v,u)=2. Compute the residual capacity cf(u,v). Review the explanation for this topic →Type your answer — press Enter to checkEnter your answer