[−][src]Struct competitive_programming_rs::graph::min_cost_flow::primal_dual::MinimumCostFlowSolver
Methods
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]
Auto Trait Implementations
impl Send for MinimumCostFlowSolver
impl Unpin for MinimumCostFlowSolver
impl Sync for MinimumCostFlowSolver
impl UnwindSafe for MinimumCostFlowSolver
impl RefUnwindSafe for MinimumCostFlowSolver
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> From<T> for T[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,