Module algorithms_edu::algo::graph::network_flow::dfs_capacity_scaling

Implementation of the Capacity Scaling algorithm using a DFS as a method of finding augmenting paths.

• Time Complexity: O(E^2log(U)), where E = num edges, U = max capacity

Resources

• W. Fiset's video

Structs

DfsCapacityScalingSolver