[−][src]Struct competitive_programming_rs::graph::maximum_flow::dinitz::Dinitz
Methods
impl Dinitz
[src][−]
pub fn new(v: usize) -> Dinitz
[src]
pub fn add_edge(&mut self, from: usize, to: usize, cap: i64)
[src]
pub fn max_flow(&mut self, s: usize, t: usize) -> i64
[src]
Auto Trait Implementations
impl Sync for Dinitz
impl Unpin for Dinitz
impl Send for Dinitz
impl UnwindSafe for Dinitz
impl RefUnwindSafe for Dinitz
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>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,