Module algorithms_edu::algo::graph::network_flow::dinic

Implementation of Dinic's network flow algorithm. The algorithm works by first constructing a level graph using a BFS and then finding augmenting paths on the level graph using multiple DFSs.

• Time Complexity: O(EV²)

Resources

• W. Fiset's video 1
• W. Fiset's video 2
• Wikipedia

Structs

DinicSolver