Struct fera_graph::algs::cycles::IsAcyclic
source · pub struct IsAcyclic<'a>(pub &'a mut bool);
Tuple Fields
0: &'a mut bool
Trait Implementations
sourceimpl<'a, G: WithEdge> Visitor<G> for IsAcyclic<'a>
impl<'a, G: WithEdge> Visitor<G> for IsAcyclic<'a>
fn start(&mut self, _g: &G) -> Control
fn discover_back_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_tree_edge(&mut self, _g: &G, _e: Edge<G>) -> Control
fn finish_tree_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> RefUnwindSafe for IsAcyclic<'a>
impl<'a> Send for IsAcyclic<'a>
impl<'a> Sync for IsAcyclic<'a>
impl<'a> Unpin for IsAcyclic<'a>
impl<'a> !UnwindSafe for IsAcyclic<'a>
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