Struct fera_graph::traverse::RecursiveDfsAlg
source · pub struct RecursiveDfsAlg<A, B, C, D>(pub A, pub B, pub C, pub D);
Tuple Fields
0: A
1: B
2: C
3: D
Implementations
sourceimpl<A, B, C, D> RecursiveDfsAlg<A, B, C, D>
impl<A, B, C, D> RecursiveDfsAlg<A, B, C, D>
pub fn graph<N>(self, zero: N) -> RecursiveDfsAlg<N, B, C, D>
pub fn visitor<N>(self, one: N) -> RecursiveDfsAlg<A, N, C, D>
pub fn roots<N>(self, two: N) -> RecursiveDfsAlg<A, B, N, D>
pub fn color<N>(self, three: N) -> RecursiveDfsAlg<A, B, C, N>
sourceimpl<'a, G, V, R, C> RecursiveDfsAlg<&'a G, V, R, C>
impl<'a, G, V, R, C> RecursiveDfsAlg<&'a G, V, R, C>
pub fn run(self) -> Controlwhere
G: Incidence,
V: Visitor<G>,
R: IntoIterator<Item = Vertex<G>>,
C: ParamDerefMut,
C::Target: VertexPropMut<G, Color>,
pub fn root(
self,
root: Vertex<G>
) -> RecursiveDfsAlg<&'a G, V, Once<Vertex<G>>, C>where
G: WithVertex,
pub fn ignore_color_changes(
self
) -> RecursiveDfsAlg<&'a G, V, R, Owned<IgnoreWriteProp<Color>>>where
G: WithVertex,
Auto Trait Implementations
impl<A, B, C, D> RefUnwindSafe for RecursiveDfsAlg<A, B, C, D>where
A: RefUnwindSafe,
B: RefUnwindSafe,
C: RefUnwindSafe,
D: RefUnwindSafe,
impl<A, B, C, D> Send for RecursiveDfsAlg<A, B, C, D>where
A: Send,
B: Send,
C: Send,
D: Send,
impl<A, B, C, D> Sync for RecursiveDfsAlg<A, B, C, D>where
A: Sync,
B: Sync,
C: Sync,
D: Sync,
impl<A, B, C, D> Unpin for RecursiveDfsAlg<A, B, C, D>where
A: Unpin,
B: Unpin,
C: Unpin,
D: Unpin,
impl<A, B, C, D> UnwindSafe for RecursiveDfsAlg<A, B, C, D>where
A: UnwindSafe,
B: UnwindSafe,
C: UnwindSafe,
D: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more