Trait petgraph::visit::Visitable

pub trait Visitable: Graphlike {
    type Map: VisitMap<Self::NodeId>;
    fn visit_map(&self) -> 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

Implementors

• impl<N, E, Ty, Ix> Visitable for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type Map = FixedBitSet;
• impl<N, E> Visitable for GraphMap<N, E> where
    N: Copy + Ord + Hash,  type Map = HashSet<N>;
• impl<'a, G: Visitable> Visitable for AsUndirected<&'a G> type Map = G::Map;
• impl<'a, G: Visitable> Visitable for Reversed<&'a G> type Map = G::Map;