Home▸Networks & Graph Theory▸Max-Flow / Min-Cut — Ford–Fulkerson (2D)

🗺 Max-Flow / Min-Cut — Ford–Fulkerson (2D)

A 2D Canvas companion running real Edmonds–Karp (BFS-based Ford–Fulkerson) on a directed capacitated network: step or auto-run augmenting paths, watch flow accumulate to the true maximum, and see the min cut revealed.

Networks & Graph Theory2DModerate60 FPS📱 Mobile-adapted⇄ 3D version

⚙ Under the hood

A 2D Canvas companion to the 3D max-flow simulation: run real Edmonds-Karp (BFS-based Ford-Fulkerson) on a directed capacitated network. Step through or auto-run augmenting paths and watch the flow value converge to the true maximum, with the min cut revealed once no path remains.

graph-theoryalgorithmsnetwork-flowedmonds-karpbfsoptimization

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install