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