Module max_flow 

Max flow / min cut algorithms.

Re-exports

pub use dinic::dinic_max_flow;

pub use edmonds_karp::edmonds_karp;

pub use min_cut::min_cut_from_max_flow;

pub use parametric_maxflow::ParametricArc;

pub use parametric_maxflow::ParametricBreakpoint;

pub use parametric_maxflow::ParametricMaxFlow;

pub use parametric_maxflow::ParametricSolution;

pub use push_relabel::push_relabel_max_flow;

Modules

dinic

Dinic’s max flow: level-graph + blocking-flow DFS. O(V^2 E).

edmonds_karp

Edmonds-Karp max flow: BFS augmenting paths. O(VE^2).

min_cut

Min cut via residual reachability from max flow.

parametric_maxflow

Parametric maximum flow (Gallo-Grigoriadis-Tarjan 1989 / Hochbaum 2008).

push_relabel

Generic Push-Relabel max flow with FIFO selection of active vertices.