Trait petgraph::visit::VisitMap

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

A mapping for storing the visited status for NodeId N.

Required Methods

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

Mark a as visited.

Return true if this is the first visit, false otherwise.

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

Return whether a has been visited before.

Implementations on Foreign Types

impl<Ix> VisitMap<EdgeIndex<Ix>> for FixedBitSet

where Ix: IndexType,

fn visit(&mut self, x: EdgeIndex<Ix>) -> bool

fn is_visited(&self, x: &EdgeIndex<Ix>) -> bool

impl<Ix> VisitMap<NodeIndex<Ix>> for FixedBitSet

where Ix: IndexType,

fn visit(&mut self, x: NodeIndex<Ix>) -> bool

fn is_visited(&self, x: &NodeIndex<Ix>) -> bool

impl<Ix> VisitMap<Ix> for FixedBitSet

where Ix: IndexType,

fn visit(&mut self, x: Ix) -> bool

fn is_visited(&self, x: &Ix) -> bool

impl<N, S> VisitMap<N> for HashSet<N, S>

where N: Hash + Eq, S: BuildHasher,

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

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

Implementors