I am currently reading the lecture slides from Princeton regarding network flows but I cannot understand how they manage to find out minimum cuts from a directed graph. Could someone explain how to find the minimum cut of this graph? I THINK the minimum capacity is 4.
How to find a minimum cut of a network flow?
graphs;network flow