Struct fera_graph::traverse::RecursiveDfsAlg

#[must_use = "call .run() to execute the algorithm"]
pub struct RecursiveDfsAlg<A, B, C, D>(pub A, pub B, pub C, pub D);

Methods

impl<A, B, C, D> RecursiveDfsAlg<A, B, C, D>

fn graph<N>(self, zero: N) -> RecursiveDfsAlg<N, B, C, D>

fn visitor<N>(self, one: N) -> RecursiveDfsAlg<A, N, C, D>

fn roots<N>(self, two: N) -> RecursiveDfsAlg<A, B, N, D>

fn color<N>(self, three: N) -> RecursiveDfsAlg<A, B, C, N>

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

fn run(self) -> Control where
    G: Incidence,
    V: Visitor<G>,
    R: IntoIterator<Item = Vertex<G>>,
    C: ParamDerefMut,
    C::Target: VertexPropMut<G, Color>, 

fn root(self, root: Vertex<G>) -> RecursiveDfsAlg<&'a G, V, Once<Vertex<G>>, C> where
    G: WithVertex, 

fn ignore_color_changes(
    self
) -> RecursiveDfsAlg<&'a G, V, R, Owned<IgnoreWriteProp<Color>>> where
    G: WithVertex,