Model and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
Key skillsModel and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
The study design publishes this in the combined Units 3–4 list; the stated content applies to Unit 4.
Build the idea
A feasible flow respects every directed capacity and conserves flow at intermediate vertices. Any source-to-sink flow is bounded by the capacity of any cut separating source from sink, counting forward cut edges. Finding a feasible flow equal to a cut capacity proves optimality. Looking only at total source or sink capacity may miss an internal bottleneck.
Try the sample task
Capacities are s→a 7, s→b 5, a→b 2, a→t 4, b→t 8. Construct a feasible flow of 11 and verify capacities and conservation.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
This focused activity develops the stated idea through one context. It is practice, not evidence that every application or subclause of a broad study-design bullet has been mastered.