pub struct EdmondsKarp<'a, G, F>where
    G: IndexDigraph,{ /* private fields */ }
Expand description

Max-flow algorithm of Edmonds and Karp.

Implementations§

source§

impl<'a, G, F> EdmondsKarp<'a, G, F>where G: IndexDigraph, F: NumAssign + Ord + Copy,

source

pub fn new(g: &'a G) -> Self

Create a new Dinic algorithm instance for a graph.

source

pub fn as_graph(&self) -> &'a G

Return the underlying graph.

source

pub fn value(&self) -> F

Return the value of the latest computed maximum flow.

source

pub fn flow(&self, e: G::Edge<'_>) -> F

Return the flow value on edge e

source

pub fn flow_iter<'b>(&'b self) -> impl Iterator<Item = (G::Edge<'a>, F)> + 'b

Return an iterator over all (edge, flow) pairs.

source

pub fn solve<Us>(&mut self, src: G::Node<'_>, snk: G::Node<'_>, upper: Us)where Us: Fn(G::Edge<'a>) -> F,

source

pub fn mincut(&self) -> Vec<G::Node<'a>>

Return the minimal cut associated with the last maximum flow.

Auto Trait Implementations§

§

impl<'a, G, F> RefUnwindSafe for EdmondsKarp<'a, G, F>where F: RefUnwindSafe, G: RefUnwindSafe,

§

impl<'a, G, F> Send for EdmondsKarp<'a, G, F>where F: Send, G: Sync,

§

impl<'a, G, F> Sync for EdmondsKarp<'a, G, F>where F: Sync, G: Sync,

§

impl<'a, G, F> Unpin for EdmondsKarp<'a, G, F>where F: Unpin,

§

impl<'a, G, F> UnwindSafe for EdmondsKarp<'a, G, F>where F: UnwindSafe, G: RefUnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

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<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.