Trait petgraph::visit::Visitable
[−]
[src]
pub trait Visitable: GraphBase { type Map: VisitMap<Self::NodeId>; fn visit_map(&self) -> Self::Map; fn reset_map(&self, map: &mut Self::Map); }
A graph that can create a map that tracks the visited status of its nodes.
Associated Types
Required Methods
fn visit_map(&self) -> Self::Map
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)
Reset the visitor map (and resize to new size of graph if needed)
Implementations on Foreign Types
impl<'a, G> Visitable for &'a G where
G: Visitable,
[src]
G: Visitable,
Implementors
impl<G, F> Visitable for NodeFiltered<G, F> where
G: Visitable, type Map = G::Map;impl<G, F> Visitable for EdgeFiltered<G, F> where
G: Visitable, type Map = G::Map;impl<G: Visitable> Visitable for Reversed<G> type Map = G::Map;
impl<N, E, Ty, Ix> Visitable for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, type Map = FixedBitSet;impl<N, E, Ty, Ix> Visitable for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, type Map = FixedBitSet;impl<N, E, Ty> Visitable for GraphMap<N, E, Ty> where
N: Copy + Ord + Hash,
Ty: EdgeType, type Map = HashSet<N>;impl<'a, G> Visitable for Frozen<'a, G> where
G: Visitable, type Map = G::Map;impl<N, E, Ty, Ix> Visitable for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, type Map = FixedBitSet;