Max flow animated: BFS finds augmenting paths, the bottleneck is pushed through, saturated edges turn red — ending at the min cut that equals the max flow.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Ford-Fulkerson Max Flow Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Max flow animated: BFS finds augmenting paths, the bottleneck is pushed through, saturated edges turn red — ending at the min cut that equals the max flow. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
BFS Visualizer: Breadth-first search on a graph: the queue-driven frontier expands ring by ring with every discovery narrated — plus a grid version with walls.
Open toolDijkstra's Algorithm Visualizer: Dijkstra's shortest path animated: settle the closest node, relax its edges, watch distances improve — with a live distance table and pseudocode.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open toolmax flow so far: 0
1Ford-Fulkerson (Edmonds-Karp): repeatedly find an augmenting path S→T with spare capacity (BFS), push the bottleneck amount through it, repeat. Labels show flow/capacity.
flow = 0 on every edgewhile BFS finds S→T with spare capacity:bottleneck = min spare on the pathpush bottleneck along the pathno path left ⇒ current flow is MAXIMUMsaturated crossing edges = min cut
Maximum flow through a capacity network: keep finding S→T paths with spare capacity, push the bottleneck amount, stop when none remain. Max flow equals the min cut.
