Module rs_graph::maxflow

Expand description

Maximum Network Flow algorithms.

Re-exports

pub use self::edmondskarp::EdmondsKarp;

pub use self::dinic::Dinic;

pub use self::pushrelabel::PushRelabel;

This module implements Dinic’ max flow algorithm

This module implements the max flow algorithm of Edmonds-Karp.

This module implements a push relabel algorithm for solving max flow problems.

Trait for max flow algorithms.

Solve the maxflow problem using Dinic’ algorithm.

Solve the maxflow problem using the algorithm of Edmonds-Karp.

Solve the maxflow problem using the push-relabel algorithm.

Solve the maxflow problem using the specified algorithm.