pub trait IntoNodeReferences: Data + IntoNodeIdentifiers {
    type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>;
    type NodeReferences: Iterator<Item = Self::NodeRef>;

    // Required method
    fn node_references(self) -> Self::NodeReferences;
}
Expand description

Access to the sequence of the graph’s nodes

Required Associated Types§

source

type NodeRef: NodeRef<NodeId = Self::NodeId, Weight = Self::NodeWeight>

source

type NodeReferences: Iterator<Item = Self::NodeRef>

Required Methods§

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

impl<'a, G> IntoNodeReferences for &'a G

Implementors§

source§

impl<'a, 'b, G> IntoNodeReferences for &'b Frozen<'a, G>

source§

impl<'a, G, F> IntoNodeReferences for &'a EdgeFiltered<G, F>

source§

impl<'a, G, F> IntoNodeReferences for &'a NodeFiltered<G, F>

source§

impl<'a, Ix, E> IntoNodeReferences for &'a List<E, Ix>
where Ix: IndexType,

source§

impl<'a, N, E, Ty> IntoNodeReferences for &'a GraphMap<N, E, Ty>
where N: NodeTrait, Ty: EdgeType,

§

type NodeRef = (N, &'a N)

§

type NodeReferences = NodeReferences<'a, N, E, Ty>

source§

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Csr<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

§

type NodeRef = (Ix, &'a N)

§

type NodeReferences = NodeReferences<'a, N, Ix>

source§

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

source§

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Graph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

source§

impl<'a, N, E, Ty, Null, Ix> IntoNodeReferences for &'a MatrixGraph<N, E, Ty, Null, Ix>
where Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType,

source§

impl<G> IntoNodeReferences for Reversed<G>