Trait petgraph::visit::IntoNodeReferences [−][src]
pub trait IntoNodeReferences: Data + IntoNodeIdentifiers { type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>; type NodeReferences: Iterator<Item = Self::NodeRef>; fn node_references(self) -> Self::NodeReferences; }
Expand description
Access to the sequence of the graph’s nodes
Associated Types
type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>
type NodeReferences: Iterator<Item = Self::NodeRef>
Required methods
fn node_references(self) -> Self::NodeReferences
Implementations on Foreign Types
type NodeReferences = G::NodeReferences
Implementors
impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F> where
G: IntoNodeReferences,
F: FilterNode<G::NodeId>,
impl<'a, N, E, Ty> IntoNodeReferences for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoNodeReferences for &'a MatrixGraph<N, E, Ty, Null, Ix>