Struct fera_graph::algs::paths::RecordPath
source · pub struct RecordPath<'a, G: WithEdge> { /* private fields */ }
Trait Implementations
sourceimpl<'a, G: WithEdge> Visitor<G> for RecordPath<'a, G>
impl<'a, G: WithEdge> Visitor<G> for RecordPath<'a, G>
fn discover_tree_edge(&mut self, g: &G, e: Edge<G>) -> Control
fn finish_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 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
Auto Trait Implementations
impl<'a, G> RefUnwindSafe for RecordPath<'a, G>where
<G as WithEdge>::Edge: RefUnwindSafe,
<G as WithVertex>::Vertex: RefUnwindSafe,
impl<'a, G> Send for RecordPath<'a, G>where
<G as WithEdge>::Edge: Send,
<G as WithVertex>::Vertex: Send,
impl<'a, G> Sync for RecordPath<'a, G>where
<G as WithEdge>::Edge: Sync,
<G as WithVertex>::Vertex: Sync,
impl<'a, G> Unpin for RecordPath<'a, G>where
<G as WithVertex>::Vertex: Unpin,
impl<'a, G> !UnwindSafe for RecordPath<'a, G>
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