0
$\begingroup$

I am looking at 7.10 from the Algorithms textbook known as DPV (Dasgupta,C. H.Papadimitriou,and U. V. Vazirani)

The graph has vertices s,t and A through F with 10 edges.

my graph

What is the best way to find the max flow and min-cut on paper? I started out with pencil and an eraser, a table with columns for forward edges and backwards edges but it seems very unwieldy to do this manually for anything more than 5 vertices and 6 or 7 edges.

I specifically need to do this on paper for an algorithms course where a question like this could show up on exams.

$\endgroup$
1
  • $\begingroup$ Can you edit your question to give a proper reference? I don't know what "DPV" is; can you list the title and authors of the book? Also, I don't know what "solve this" means; you give only a graph. Please explain what you want to do with the graph and make sure the body of your question is self-contained. Thank you. $\endgroup$
    – D.W.
    Mar 9 '21 at 7:22

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.