[Solved]Given Flow Network G N 4 Vertices Besides Source Sand Sink T Also Given Two Special Vertic Q37104890

You are given a flow network G with n >4 vertices. Besidesthe source sand the sink t, you are also given two other specialvertices u and v belonging to G. Describe an algorithm which findsa cut of the smallest possible capacity among all cuts in whichvertex u is at the same side of the cut as the sources and vertex vis at the same side as sink t.

Hint: it is enough to ad two edges, but students often prefer toadd a super source and a super sink

Expert Answer

---

Answer to You are given a flow network G with n >4 vertices. Besides the source sand the sink t, you are also given two other spec… . . .