##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Small network)
Consider connected to (capacity ) and (capacity ). Both and connect to with capacity each.
You send through (limited by ) and through (limited by ). Max flow is . The min cut is with total capacity , separating from .
Notice that max flow equals the min cut capacity. This confirms the max-flow min-cut theorem on a concrete example.
