Compute the maximum flow and the minimum cut capacity in the flow network below

Question

Compute the maximum flow and the minimum cut capacity in the flow network below with source s and sink t. Capacities of arcs are indicated next to the arc in (parenthesis). When computing the flows you can indicate the flow on an arc, for example on arc xy with the notation 10/15 meaning the flow is 10 and the capacity of arc xy is 15. Show the residual network at each iteration, the augmenting path, and the current flow after the augmentation. Finally show the minimum cut. Recall that the Max-Flow Min-Cut theorem states that the value of the maximum flow is equal to the minimum cut capacity in the flow network. G=(V, A) V={s, A, B, C, D, E, F, t} A={s A(500), s B(500), s C(500), AB(80), AD(200), BC(50), BE(300) CF(250), DE(50), Dt (500), EA(100), EC(100), EF(80), Et(100), Ft(500)}

Explanation / Answer

please go through this link..

Links

https://www.youtube.com/watch?v=7jFoyLk2VjM

https://www.youtube.com/watch?v=97_9_Cuiybs

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.