pub(crate) trait IterNodes: DirectedGraph {
// Provided method
fn iter_nodes(
&self,
) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator { ... }
}Provided Methods§
Sourcefn iter_nodes(
&self,
) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator
fn iter_nodes( &self, ) -> impl Iterator<Item = Self::Node> + DoubleEndedIterator + ExactSizeIterator
Iterates over all nodes of a graph in ascending numeric order.
Assumes that nodes are densely numbered, i.e. every index in
0..num_nodes is a valid node.
FIXME: Can this just be part of graph::DirectedGraph?
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.