Trait petgraph::visit::Visitable

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

Trait for GraphMap that knows which datastructure is the best for its 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
• impl<N, E> Visitable for GraphMap<N, E> where N: Copy + Clone + Ord + Eq + Hash
• impl<'a, V: Visitable> Visitable for AsUndirected<&'a V>
• impl<'a, V: Visitable> Visitable for Reversed<&'a V>