# MaxFlow Problem MinCut

Yesterday I found a question here, that asked, if the value of the flow across the edges of the MinCut is at capacity.

I think the question has been deleted.

But I want to confirm that for the edges that are on the MinCut, after the MaxFlow is found, their flow values will either be zero or equal to their full capacities. Is it correct or not ?

• What are your thoughts? Have you tried working through some examples? Have you spotted a pattern? Have you tried to prove the pattern or look for a counterexample? Where did you get stuck? We're happy to help you understand the concepts but just solving exercise-style problems for you is unlikely to achieve that. You might find this page helpful in improving your question. – D.W. Mar 28 '18 at 18:50
• @D.W. according to me at the mincut, for the the two sets A and B, A has the nodes (in the residual graph) reachable from s and other nodes end up in B. Since, nodes of B in residual graph are not reachable from s, there should not be a backward edge to the nodes in B , which is possible if the flow through the edge is at full capacity or the edge is in reverse direction in G, where the flow through such an edge should be zero. So I believe the answer is correct. P.S. this is not a homework question :P – S K Mar 28 '18 at 19:46