5. 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
PayPal Gateway not configured
PayPal Gateway not configured