Struct competitive_programming_rs::graph::min_cost_flow::primal_dual::MinimumCostFlowSolver

pub struct MinimumCostFlowSolver { /* fields omitted */ }

Implementations

impl MinimumCostFlowSolver

pub fn new(n: usize) -> Self

pub fn add_edge(&mut self, from: usize, to: usize, capacity: i64, cost: i64)

pub fn solve(&mut self, source: usize, sink: usize, flow: i64) -> Option<i64>

Find the minimum cost to send flow through a flow network from source to sink.

pub fn neg_solve(
    &mut self,
    source: usize,
    sink: usize,
    flow: i64
) -> Option<i64>

Find the minimum cost to send flow through a flow network, which contains edges of negative cost, from source to sink.