Max Flow / Min Cut
Ford-Fulkerson algorithm — find maximum flow through a network
Find Max Flow
Step by Step
Simple
Complex
Parallel
Clear
Green=Source(S), Red=Sink(T). Click to place nodes, Shift+drag to add edges.