[][src]Struct rs_graph::maxflow::dinic::Dinic

pub struct Dinic<'a, G, F> where
    G: 'a + IndexDigraph<'a>, 
{ /* fields omitted */ }

The dinic max-flow algorithm.

Trait Implementations

impl<'a, G, F> MaxFlow<'a> for Dinic<'a, G, F> where
    G: IndexDigraph<'a>,
    F: NumAssign + Ord + Copy
[src]

type Graph = G

Type of the underlying graph.

type Flow = F

Type of flows.

Auto Trait Implementations

impl<'a, G, F> RefUnwindSafe for Dinic<'a, G, F> where
    F: RefUnwindSafe,
    G: RefUnwindSafe,
    <G as GraphType<'a>>::Edge: RefUnwindSafe,
    <G as GraphType<'a>>::Node: RefUnwindSafe

impl<'a, G, F> Send for Dinic<'a, G, F> where
    F: Send,
    G: Sync,
    <G as GraphType<'a>>::Edge: Send,
    <G as GraphType<'a>>::Node: Send

impl<'a, G, F> Sync for Dinic<'a, G, F> where
    F: Sync,
    G: Sync,
    <G as GraphType<'a>>::Edge: Sync,
    <G as GraphType<'a>>::Node: Sync

impl<'a, G, F> Unpin for Dinic<'a, G, F> where
    F: Unpin,
    <G as GraphType<'a>>::Edge: Unpin,
    <G as GraphType<'a>>::Node: Unpin

impl<'a, G, F> UnwindSafe for Dinic<'a, G, F> where
    F: UnwindSafe,
    G: RefUnwindSafe,
    <G as GraphType<'a>>::Edge: UnwindSafe,
    <G as GraphType<'a>>::Node: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.