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.
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.