[−][src]Trait petgraph::visit::Visitable
A graph that can create a map that tracks the visited status of its nodes.
Associated Types
Loading content...Required methods
pub fn visit_map(&self) -> Self::Map
[src]
Create a new visitor map
pub fn reset_map(&self, map: &mut Self::Map)
[src]
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,
type Map = G::Map
pub fn visit_map(&self) -> Self::Map
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
Implementors
impl<'a, G> Visitable for Frozen<'a, G> where
G: Visitable,
[src]
G: Visitable,
type Map = G::Map
pub fn visit_map(&self) -> Self::Map
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<E, Ix> Visitable for List<E, Ix> where
Ix: IndexType,
[src]
Ix: IndexType,
type Map = FixedBitSet
pub fn visit_map(&self) -> FixedBitSet
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<G, F> Visitable for EdgeFiltered<G, F> where
G: Visitable,
[src]
G: Visitable,
type Map = G::Map
pub fn visit_map(&self) -> Self::Map
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<G, F> Visitable for NodeFiltered<G, F> where
G: Visitable,
[src]
G: Visitable,
type Map = G::Map
pub fn visit_map(&self) -> Self::Map
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<G: Visitable> Visitable for Reversed<G>
[src]
type Map = G::Map
pub fn visit_map(&self) -> G::Map
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<N, E, Ty> Visitable for GraphMap<N, E, Ty> where
N: Copy + Ord + Hash,
Ty: EdgeType,
[src]
N: Copy + Ord + Hash,
Ty: EdgeType,
type Map = HashSet<N>
pub fn visit_map(&self) -> HashSet<N>
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<N, E, Ty, Ix> Visitable for Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
type Map = FixedBitSet
pub fn visit_map(&self) -> FixedBitSet
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<N, E, Ty, Ix> Visitable for Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
type Map = FixedBitSet
pub fn visit_map(&self) -> FixedBitSet
[src]
pub fn reset_map(&self, map: &mut Self::Map)
[src]
impl<N, E, Ty, Ix> Visitable for StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,