Trait daggy::petgraph::visit::VisitMap

pub trait VisitMap<N> {
    fn visit(&mut self, N) -> bool;
    fn is_visited(&self, &N) -> bool;
}

A mapping for storing the visited status for NodeId N.

Required Methods

fn visit(&mut self, N) -> bool

Return true if the value is not already present.

fn is_visited(&self, &N) -> bool

Implementors

• impl<Ix> VisitMap<NodeIndex<Ix>> for FixedBitSet where Ix: IndexType
• impl<Ix> VisitMap<EdgeIndex<Ix>> for FixedBitSet where Ix: IndexType
• impl<N> VisitMap<N> for HashSet<N, RandomState> where N: Eq + Hash