1//! Flow algorithms: min-cost max-flow via Successive Shortest Paths. 2 3pub mod min_cost_flow; 4 5pub use min_cost_flow::{McfEdge, McfResult, min_cost_flow};