Consider a network with nodes: source , nodes and , and sink . Edges: capacity , capacity , capacity , capacity , capacity .
Maximum flow is : send through and through . The bottleneck is the total capacity leaving ( + = ).
This small example illustrates flow conservation: what enters a node must leave it (except source and sink). Maximum flow finds the best way to route without exceeding capacities.