[Solved]Given Flow Network G N 4 Vertices Besides Source S Sink T Also Given Two Special Vertices Q37100878

You are given a flow network G with n > 4 vertices. Besides the source s and the sink t, you are also given two other special vertices u and v belonging to G. Describe an algorithm which finds a cut of the smallest possible capacity among all cuts in which vertex u is at the same side of the cut as the source s and vertex v is at the same side as sink t. Show transcribed image text You are given a flow network G with n > 4 vertices. Besides the source s and the sink t, you are also given two other special vertices u and v belonging to G. Describe an algorithm which finds a cut of the smallest possible capacity among all cuts in which vertex u is at the same side of the cut as the source s and vertex v is at the same side as sink t.

Expert Answer

---

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