Home Visualizer Algorithms Docs
v2.4 — Ford-Fulkerson + Dinic's Algorithm

Visualize
Network
Flow

Real-time max-flow analysis, graph editing, and algorithm step-through for researchers, educators, and engineers.

Open Visualizer Explore Algorithms
12+Algorithms
Graph Size
10msAvg Render
// CAPABILITIES

Built for Precision

Live Step-Through

Pause, rewind, and step forward through any algorithm execution. Inspect augmenting paths and residual capacities at every iteration.

Interactive

Graph Editor

Drag-and-drop node placement with instant edge capacity assignment.

Editor

Residual Graph

Automatic residual network overlay with forward and backward edge visualization.

Analysis

Min-Cut Detection

Identify the minimum cut automatically after max-flow computation.

Analysis

Export & Share

Export graphs as JSON, PNG, or SVG. Share a URL that restores the exact graph state and algorithm progress.

Export
// ALGORITHMS

Supported Methods

01 Dinic's Algorithm Fastest
02 Ford-Fulkerson Classic
03 Push-Relabel Optimal
04 Edmonds-Karp BFS-based
05 Capacity Scaling Approx
View all algorithms →

Start Analyzing Flows

No setup needed. Open the visualizer and build your first network in seconds.

Launch Visualizer →