Trait fera_graph::traverse::Traverser
[−]
[src]
pub trait Traverser<'a, G> where
G: 'a + Incidence, { fn graph(&self) -> &G; fn is_discovered(&self, v: Vertex<G>) -> bool; fn traverse<V: Visitor<G>>(&mut self, v: Vertex<G>, vis: V) -> bool; fn traverse_all<V: Visitor<G>>(&mut self, vis: V)
where
G: VertexList; fn traverse_vertices<I, V>(&mut self, vertices: I, vis: V)
where
I: IntoIterator<Item = Vertex<G>>,
V: Visitor<G>, { ... } }
Required Methods
fn graph(&self) -> &G
fn is_discovered(&self, v: Vertex<G>) -> bool
fn traverse<V: Visitor<G>>(&mut self, v: Vertex<G>, vis: V) -> bool
fn traverse_all<V: Visitor<G>>(&mut self, vis: V) where
G: VertexList,
G: VertexList,
Provided Methods
fn traverse_vertices<I, V>(&mut self, vertices: I, vis: V) where
I: IntoIterator<Item = Vertex<G>>,
V: Visitor<G>,
I: IntoIterator<Item = Vertex<G>>,
V: Visitor<G>,