Trait petgraph::visit::Visitable

pub trait Visitable: GraphBase {
    type Map: VisitMap<Self::NodeId>;
    fn visit_map(&self) -> Self::Map;
    fn reset_map(&self, &mut Self::Map);
}

A graph that can create a visitor map.

Associated Types

type Map: VisitMap<Self::NodeId>

Required Methods

fn visit_map(&self) -> Self::Map

fn reset_map(&self, &mut Self::Map)

Reset the visitor map (and resize to new size of graph if needed)

Implementors

• impl<'a, G> Visitable for &'a G where G: Visitable
• impl<N, E, Ty, Ix> Visitable for Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<N, E, Ty, Ix> Visitable for StableGraph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, G> Visitable for Frozen<'a, G> where G: Visitable
• impl<N, E> Visitable for GraphMap<N, E> where N: Copy + Ord + Hash
• impl<G: Visitable> Visitable for AsUndirected<G>
• impl<G: Visitable> Visitable for Reversed<G>