Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

flow network

A directed graph where each edge has a capacity limit, plus a source and a sink, used to model how much can move through the network at once.

A flow network is a directed graph with a capacity $c(e)\ge0$ on each edge, a source $s$ , and a sink $t$ ; a flow assigns each edge a value $0\le f(e)\le c(e)$ obeying conservation at every vertex except $s,t$ .

See also

max-flow min-cut theorem

Read the full section →

snap pen only

Graph settings

indep dep deg

grid intersections

xmin xmax ymin ymax

x-tick y-tick

Calculator