5.7.2A Maximum flow algorithm Lemma 5.3: Let f be a conservation flow, e(,V-P) be a cut. If ViC(,v-P),then Vr, Cmin(P,V-P=C(,V-P) max Proof: By the theorem 5.23 Theorem 5.23: For every conservation flow and any cut E(P,V-P), the result holds: VsC(,V-P)▪ 5.7.2 A Maximum flow algorithm ▪ Lemma 5.3: Let f be a conservation flow, E(P,V-P) be a cut. If Vf=C(P,V-P), then Vfmax =Vf ,Cmin(P,V-P)=C(P,V-P). ▪ Proof: By the theorem 5.23, ▪ Theorem 5.23: For every conservation flow f and any cut E(P,V-P), the result holds: Vf C(P,V-P)