##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Step by step)
Compute max flow from to using any max flow algorithm (Dinic, Ford-Fulkerson, etc.).
Build the residual graph after max flow. Include edges with remaining capacity.
Run BFS/DFS from in the residual graph to mark all reachable vertices as .
All other vertices form . These are unreachable from .
Edges from to in the original graph form the minimum cut.
