← Back to Gallery

Dinic Max-Flow Algorithm

Level graph construction and blocking flow augmentation

Graph

Preset Graph:

Algorithm

Current Phase:

Ready

Statistics

0

Max Flow

0

BFS Iterations

0

Aug. Paths

-

Sink Level

Legend

Flow / Capacity

Saturated Edge

Level Graph Edge

Augmenting Path

About

Dinic's algorithm finds max-flow in O(V²E). Each iteration: 1) BFS builds a level graph from source 2) DFS finds blocking flows until no path exists Repeat until sink is unreachable.