How much can a network carry? Pipes, roads and data links all obey the same law: the maximum flow through a network equals the capacity of its tightest cut. Find the bottleneck and you have found the answer. This is the real knowscape from knowhere, not a picture of one. Drag it. Watch what actually changes.
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.
The maximum flow through a network from source to sink equals the minimum capacity of any cut that separates source from sink, meaning the bottleneck determines total throughput.
knowhere maps every concept to what it rests on and what rests on it — 1 underneath this one, 0 built on top. Each one says why, in a sentence, not as an arrow on a diagram.
Each one is its own knowscape in the app — built for how a particular student takes things in, not one explanation handed to everybody.
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 card tricks, no lecture.
Free for a week, then $49 once — the 2026 exam pass ends itself after the last exam. 0 days of the pass left.
Free for a week, then a plan you can stop any time.
not your card? send it to whoever's is.