Struct fera_graph::algs::paths::RecordPath
[−]
[src]
pub struct RecordPath<'a, G: WithEdge> { /* fields omitted */ }
pub struct RecordPath<'a, G: WithEdge> { /* fields omitted */ }
impl<'a, G: WithEdge> Visitor<G> for RecordPath<'a, G>[src]fn discover_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control[src]fn finish_tree_edge(&mut self, _g: &G, e: Edge<G>) -> Control[src]fn start(&mut self, _g: &G) -> Control[src]fn finish(&mut self, _g: &G) -> Control[src]fn discover_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control[src]fn finish_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control[src]fn discover_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control[src]fn finish_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control[src]fn discover_edge(&mut self, _g: &G, _e: Edge<G>) -> Control[src]fn finish_edge(&mut self, _g: &G, _e: Edge<G>) -> Control[src]fn discover_back_edge(&mut self, _g: &G, _e: Edge<G>) -> Control[src]fn discover_cross_or_forward_edge(&mut self, _g: &G, _e: Edge<G>) -> Control[src]