Expand description
Flow algorithms: min-cost max-flow via Successive Shortest Paths.
Re-exports§
pub use min_cost_flow::McfEdge;pub use min_cost_flow::McfResult;pub use min_cost_flow::min_cost_flow;
Modules§
- min_
cost_ flow - Min-cost max-flow via Successive Shortest Paths (SPFA / Bellman-Ford with queue).