Dinic

rs_graph::maxflow::dinic

Struct Dinic 

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

The dinic max-flow algorithm.

Implementations§

Source§

impl<'a, G, F> Dinic<'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,

Solve the maxflow problem.

The method solved the max flow problem from the source node src to the sink node snk with the given upper bounds on the edges.

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> Freeze for Dinic<'a, G, F>
where F: Freeze,

§

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

§

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

§

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

§

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

§

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

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,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where 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 T
where 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

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

Source§

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 T
where U: TryFrom<T>,

Source§

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.