Struct RecursiveDfsAlg 

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

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>

impl<'a, G, V, R, C> RecursiveDfsAlg<&'a G, V, R, C>

pub fn run(self) -> Control

where 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,