Module network_flow

Re-exports

pub use dfs_capacity_scaling::DfsCapacityScalingSolver;

pub use dinic::DinicSolver;

pub use edmonds_karp::EdmondsKarpSolver;

Modules

dfs_capacity_scaling

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

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.

edmonds_karp

ford_fulkerson_dfs

An implementation of the Ford-Fulkerson (FF) method with a DFS as a method of finding augmenting paths. FF allows you to find the max flow through a directed graph as well as the min cut as a byproduct.

Structs

Edge

This edge type is designed specifically for networkflow graphs.

NetworkFlowAdjacencyList

Traits

MaxFlowSolver