Trait IntoNodeIdentifiers

pub trait IntoNodeIdentifiers: GraphRef {
    type NodeIdentifiers: Iterator<Item = Self::NodeId>;

    // Required method
    fn node_identifiers(self) -> Self::NodeIdentifiers;
}

Access to the sequence of the graph’s NodeIds.

Required Associated Types

type NodeIdentifiers: Iterator<Item = Self::NodeId>

Required Methods

fn node_identifiers(self) -> Self::NodeIdentifiers

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.

Implementations on Foreign Types

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

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

fn node_identifiers(self) -> Self::NodeIdentifiers

Implementors

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

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

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

type NodeIdentifiers = NodeIndices<Ix>

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

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers

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

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

type NodeIdentifiers = NodeFilteredNeighbors<'a, <G as IntoNodeIdentifiers>::NodeIdentifiers, F>

impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIdentifiers<Ix>

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

where Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIndices<Ix>

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

where Ty: EdgeType, Ix: IndexType,

type NodeIdentifiers = NodeIndices<'a, N, Ix>

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

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

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

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

type NodeIdentifiers = NodeIdentifiers<'a, Ix>

impl<G> IntoNodeIdentifiers for Reversed<G>

where G: IntoNodeIdentifiers,

type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers