Struct fera_graph::traverse::RecordDistance
source · pub struct RecordDistance<'a, P: 'a, T> { /* private fields */ }
Trait Implementations
sourceimpl<'a, G, P, T> Visitor<G> for RecordDistance<'a, P, T>where
G: WithEdge,
P: VertexPropMut<G, T>,
T: Counter + Copy + Zero,
impl<'a, G, P, T> Visitor<G> for RecordDistance<'a, P, T>where
G: WithEdge,
P: VertexPropMut<G, T>,
T: Counter + Copy + Zero,
fn discover_root_vertex(&mut self, _g: &G, v: Vertex<G>) -> Control
fn discover_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control
fn start(&mut self, _g: &G) -> Control
fn finish(&mut self, _g: &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 finish_tree_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
Auto Trait Implementations
impl<'a, P, T> RefUnwindSafe for RecordDistance<'a, P, T>where
P: RefUnwindSafe,
T: RefUnwindSafe,
impl<'a, P, T> Send for RecordDistance<'a, P, T>where
P: Send,
T: Send,
impl<'a, P, T> Sync for RecordDistance<'a, P, T>where
P: Sync,
T: Sync,
impl<'a, P, T> Unpin for RecordDistance<'a, P, T>where
T: Unpin,
impl<'a, P, T> !UnwindSafe for RecordDistance<'a, P, T>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more