Network flow, cuts and maximum flow

What this note covers

1. From Year 11 networks to flow networks: key terms
2. Converting a table into a weighted directed network
3. Flow capacity and the saturated-edges method
4. Cuts and the capacity of a cut
5. The maximum-flow minimum-cut theorem
6. The effect of changing one edge's capacity
7. Does the network meet the demand?

7 sections · 13 key terms & formulas · 6 common mistakes

Common questions