Struct BfsAlg 

pub struct BfsAlg<A, B, C, D, E>(pub A, pub B, pub C, pub D, pub E);

Tuple Fields

0: A

1: B

2: C

3: D

4: E

Implementations

impl<A, B, C, D, E> BfsAlg<A, B, C, D, E>

pub fn graph<N>(self, zero: N) -> BfsAlg<N, B, C, D, E>

pub fn visitor<N>(self, one: N) -> BfsAlg<A, N, C, D, E>

pub fn roots<N>(self, two: N) -> BfsAlg<A, B, N, D, E>

pub fn color<N>(self, three: N) -> BfsAlg<A, B, C, N, E>

pub fn queue<N>(self, four: N) -> BfsAlg<A, B, C, D, N>

impl<'a, G, V, R, C, Q> BfsAlg<&'a G, V, R, C, Q>

pub fn run(self) -> Control

where G: Incidence, V: Visitor<G>, R: IntoIterator<Item = Vertex<G>>, C: ParamDerefMut, C::Target: VertexPropMut<G, Color>, Q: ParamDerefMut<Target = BfsQueue<G>>,

pub fn root(self, root: Vertex<G>) -> BfsAlg<&'a G, V, Once<Vertex<G>>, C, Q>

where G: WithVertex,

pub fn ignore_color_changes( self, ) -> BfsAlg<&'a G, V, R, Owned<IgnoreWriteProp<Color>>, Q>

where G: WithVertex,