HSC · Mathematics Standard 2 · Networks · also VCE Networks & Decision Maths live from the app

Network Flow and the Maximum-Flow Minimum-Cut Theorem

A flow network is a set of pipes with capacities running from a source to a sink. A cut is any way of splitting the nodes into a source side and a sink side; its capacity is the total of the pipes crossing forward, from the source side to the sink side. Every unit of oil that reaches the terminal must cross every cut, so no flow can beat the smallest cut, and the max-flow min-cut theorem says the maximum flow is exactly equal to that minimum cut. Here the tank can release 24, but only 23 ever arrives, because the two pipes into the terminal add to 23. This is the real knowscape from knowhere, not a picture of one. Drag it. Watch what actually changes.

mathematics standard 2 · networks · network flow and the maximum-flow minimum-cut theoremdrag it · it is yours
the one idea

why this one carries the topic.

A network is a diagram that turns a real system — roads, pipes, cables, schedules — into dots and weighted lines, and every question is about optimising one thing along those lines. Either you connect everything for the least total cost (spanning tree) or you push the most through a fixed structure (flow). The bottleneck is always the answer.

Oil flows from a tank through five pipes to a terminal while a dashed amber line shows one of the four source–sink cuts and sums its forward pipes, so a flow of 23 can be matched against cuts of 24, 25, 26 and 23.

what examiners catch — Students read the pipes out of the source (24 here) and call that the answer, or they add every pipe a cut line touches, including one pointing back towards the source. What earns the mark is listing each source–sink partition, summing only forward capacities, taking the smallest, and showing a flow that reaches it.
what you leave with

five things, not forty.

what's underneath

nothing here is a standalone fact.

knowhere maps every concept to what it rests on and what rests on it — 3 underneath this one, 0 built on top. Each one says why, in a sentence, not as an arrow on a diagram.

this conceptnetwork flow and the maximum-flow minimum-cut theoremOil flows from a tank through five pipes to a terminal while a dashed amber line shows one of the four source–sink cuts and sums its forward pipes, so a flow of 23 can be matched against cuts of 24, 25, 26 and 23.
sits under itnetwork components and terminologybecause source, sink and cut are network terminology
sits under itthe language of graphs and networksbecause Naming paths from source to sink relies on standard graph vocabulary.
sits under itgraph theory fundamentalsbecause Partitioning a vertex set into two groups is the idea behind a cut.
the rest of networks

3 more, same treatment.

Each one is its own knowscape in the app — built for how a particular student takes things in, not one explanation handed to everybody.

network flow and critical path analysisin the appminimum spanning treesin the appproject scheduling and critical pathin the app
this is one of 865

they don't read it. they run it.

Every HSC and VCE concept in knowhere is built like this one — mapped to your curriculum, never capped by it. Free for a week. No lock-in, cancel inside the week and pay nothing.

the 2026 exam pass

Free for a week, then one payment. It ends itself after the last exam — no subscription.

$49 once. 0 days left

Free for a week, then a plan you can stop any time.

not your card? send it to whoever's is.

knowhere›hsc mathematics standard 2›network flow and the maximum-flow minimum-cut theorem