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

source · [−]

pub struct MinimumCostFlowSolver { /* private fields */ }

Implementations

source

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.

source

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.

Auto Trait Implementations

impl RefUnwindSafe for MinimumCostFlowSolver

impl Send for MinimumCostFlowSolver

impl Sync for MinimumCostFlowSolver

impl Unpin for MinimumCostFlowSolver

impl UnwindSafe for MinimumCostFlowSolver

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

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

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>

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

Auto Trait Implementations

impl RefUnwindSafe for MinimumCostFlowSolver

impl Send for MinimumCostFlowSolver

impl Sync for MinimumCostFlowSolver

impl Unpin for MinimumCostFlowSolver

impl UnwindSafe for MinimumCostFlowSolver

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

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

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

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

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>

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

Auto Trait Implementations

impl RefUnwindSafe for MinimumCostFlowSolver

impl Send for MinimumCostFlowSolver

impl Sync for MinimumCostFlowSolver

impl Unpin for MinimumCostFlowSolver

impl UnwindSafe for MinimumCostFlowSolver

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

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

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

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

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,