[][src]Struct competitive_programming_rs::graph::min_cost_flow::primal_dual::MinimumCostFlowSolver

pub struct MinimumCostFlowSolver { /* fields omitted */ }

Implementations

impl MinimumCostFlowSolver[src]

pub fn new(n: usize) -> Self[src]

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

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

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

Auto Trait Implementations

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,