This is a question about Max Flow. Please give a detailedanswer, thank you.
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 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
OR
OR