[−][src]Struct rs_graph::maxflow::pushrelabel::PushRelabel
The push-relabel algorithm.
This struct contains all algorithmic working data.
Fields
cnt_relabel: usize
The number of relabel operations performed during the algorithm.
use_global_relabelling: bool
Whether to use the global relabelling heuristic.
Trait Implementations
impl<'a, G, F> MaxFlow<'a> for PushRelabel<'a, G, F> where
G: IndexDigraph<'a>,
F: NumAssign + Ord + Copy,
[src]
G: IndexDigraph<'a>,
F: NumAssign + Ord + Copy,
type Graph = G
Type of the underlying graph.
type Flow = F
Type of flows.
fn new(g: &'a G) -> Self
[src]
Return a new push-relabel algorithm data structure for the digraph g
.
fn as_graph(&self) -> &'a Self::Graph
[src]
Return a reference to the underlying graph.
fn value(&self) -> F
[src]
Return the flow value.
The function returns 0 if the flow has not been computed, yet.
fn flow(&self, e: G::Edge) -> F
[src]
Return the flow value over some edge.
The function returns 0 if the flow has not been computed, yet.
fn solve<Us>(&mut self, src: G::Node, snk: G::Node, upper: Us) where
Us: Fn(G::Edge) -> Self::Flow,
[src]
Us: Fn(G::Edge) -> Self::Flow,
Run the push-relabel algorithm from some source to some sink node.
fn mincut(&self) -> Vec<G::Node>
[src]
Return the minimal cut.
fn flow_vec(&self) -> EdgeVec<'a, &'a Self::Graph, Self::Flow>
[src]
Auto Trait Implementations
impl<'a, G, F> RefUnwindSafe for PushRelabel<'a, G, F> where
F: RefUnwindSafe,
G: RefUnwindSafe,
<G as Directed<'a>>::IncidentEdge: RefUnwindSafe,
<G as GraphType<'a>>::Node: RefUnwindSafe,
F: RefUnwindSafe,
G: RefUnwindSafe,
<G as Directed<'a>>::IncidentEdge: RefUnwindSafe,
<G as GraphType<'a>>::Node: RefUnwindSafe,
impl<'a, G, F> Send for PushRelabel<'a, G, F> where
F: Send,
G: Sync,
<G as Directed<'a>>::IncidentEdge: Send,
<G as GraphType<'a>>::Node: Send,
F: Send,
G: Sync,
<G as Directed<'a>>::IncidentEdge: Send,
<G as GraphType<'a>>::Node: Send,
impl<'a, G, F> Sync for PushRelabel<'a, G, F> where
F: Sync,
G: Sync,
<G as Directed<'a>>::IncidentEdge: Sync,
<G as GraphType<'a>>::Node: Sync,
F: Sync,
G: Sync,
<G as Directed<'a>>::IncidentEdge: Sync,
<G as GraphType<'a>>::Node: Sync,
impl<'a, G, F> Unpin for PushRelabel<'a, G, F> where
F: Unpin,
<G as Directed<'a>>::IncidentEdge: Unpin,
<G as GraphType<'a>>::Node: Unpin,
F: Unpin,
<G as Directed<'a>>::IncidentEdge: Unpin,
<G as GraphType<'a>>::Node: Unpin,
impl<'a, G, F> UnwindSafe for PushRelabel<'a, G, F> where
F: UnwindSafe,
G: RefUnwindSafe,
<G as Directed<'a>>::IncidentEdge: UnwindSafe,
<G as GraphType<'a>>::Node: UnwindSafe,
F: UnwindSafe,
G: RefUnwindSafe,
<G as Directed<'a>>::IncidentEdge: UnwindSafe,
<G as GraphType<'a>>::Node: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
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>,