pub fn min_cost_flow( nodes: usize, supply: &[i64], arcs: &[Arc], ) -> Result<Solution, FlowError>
The least-cost flow meeting supply (positive where flow starts, negative where it ends) over arcs.
supply
arcs