Trait IntoNodeReferences 

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;
}

Access to the sequence of the graph’s nodes

Required 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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

fn node_references(self) -> Self::NodeReferences

Implementors

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

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

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

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

where G: IntoNodeReferences, F: FilterNode<G::NodeId>,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = NodeFilteredNodes<'a, <G as IntoNodeReferences>::NodeReferences, F>

impl<'a, N, E, Ix: IndexType> IntoNodeReferences for &'a Acyclic<DiGraph<N, E, Ix>>

type NodeRef = <&'a Graph<N, E, Directed, Ix> as IntoNodeReferences>::NodeRef

type NodeReferences = <&'a Graph<N, E, Directed, Ix> as IntoNodeReferences>::NodeReferences

impl<'a, N, E, Ix: IndexType> IntoNodeReferences for &'a Acyclic<StableDiGraph<N, E, Ix>>

type NodeRef = <&'a StableGraph<N, E, Directed, Ix> as IntoNodeReferences>::NodeRef

type NodeReferences = <&'a StableGraph<N, E, Directed, Ix> as IntoNodeReferences>::NodeReferences

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>

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeRef = (NodeIndex<Ix>, &'a N)

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

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeRef = (NodeIndex<Ix>, &'a N)

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

impl<'a, N, E, Ty, S> IntoNodeReferences for &'a GraphMap<N, E, Ty, S>

where N: NodeTrait, Ty: EdgeType, S: BuildHasher,

type NodeRef = (N, &'a N)

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

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

type NodeRef = (NodeIndex<Ix>, &'a N)

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

impl<G> IntoNodeReferences for Reversed<G>

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

impl<G> IntoNodeReferences for UndirectedAdaptor<G>

where G: IntoNodeReferences,

type NodeRef = <G as IntoNodeReferences>::NodeRef

type NodeReferences = <G as IntoNodeReferences>::NodeReferences

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

type NodeRef = Ix

type NodeReferences = NodeIndices<Ix>