5.5. Graph as network, maximal flows and minimal cuts, the max flow-min cut theorem Notes | Discrete Structure BEI-NEW | TU | TABFlux