Struct fera_graph::traverse::FarthestVertex

pub struct FarthestVertex<'a, G: WithVertex> { /* fields omitted */ }

Trait Implementations

impl<'a, G> Visitor<G> for FarthestVertex<'a, G> where
    G: 'a + WithEdge, 

fn start(&mut self, _: &G) -> Control

fn finish_tree_edge(&mut self, _: &G, _: Edge<G>) -> Control

fn discover_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control

fn finish(&mut self, _g: &G) -> Control

fn discover_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_root_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn discover_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn finish_vertex(&mut self, _g: &G, _v: Vertex<G>) -> Control

fn discover_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn finish_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_back_edge(&mut self, _g: &G, _e: Edge<G>) -> Control

fn discover_cross_or_forward_edge(&mut self, _g: &G, _e: Edge<G>) -> Control