Trait petgraph::visit::IntoNodeIdentifiers

pub trait IntoNodeIdentifiers: GraphRef {
    type NodeIdentifiers: Iterator<Item = Self::NodeId>;
    fn node_identifiers(self) -> Self::NodeIdentifiers;
}

Access to the sequence of the graph’s NodeIds.

Associated Types

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

Required Methods

fn node_identifiers(self) -> Self::NodeIdentifiers

Implementations on Foreign Types

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

type NodeIdentifiers = G::NodeIdentifiers

fn node_identifiers(self) -> Self::NodeIdentifiers

Implementors

• impl<'a, G, F> IntoNodeIdentifiers for &'a NodeFiltered<G, F> where     G: IntoNodeIdentifiers,     F: FilterNode<G::NodeId>,  type NodeIdentifiers = NodeFilteredNeighbors<'a, G::NodeIdentifiers, F>;

• impl<'a, G, F> IntoNodeIdentifiers for &'a EdgeFiltered<G, F> where     G: IntoNodeIdentifiers,  type NodeIdentifiers = G::NodeIdentifiers;

• impl<G> IntoNodeIdentifiers for Reversed<G> where     G: IntoNodeIdentifiers,  type NodeIdentifiers = G::NodeIdentifiers;

• 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> IntoNodeIdentifiers for &'a GraphMap<N, E, Ty> where     N: NodeTrait,     Ty: EdgeType,  type NodeIdentifiers = NodeIdentifiers<'a, N, E, Ty>;

• impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G> where     G: IntoNodeIdentifiers,  type NodeIdentifiers = G::NodeIdentifiers;

• impl<'a, N, E, Ty, Ix> IntoNodeIdentifiers for &'a Csr<N, E, Ty, Ix> where     Ty: EdgeType,     Ix: IndexType,  type NodeIdentifiers = NodeIdentifiers<Ix>;