petgraph::visit

Trait IntoNodeIdentifiers

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

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

Access to the sequence of the graph’s NodeIds.

Required Associated Types§

Required Methods§

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§

Source§

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

Implementors§

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

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

Source§

impl<G> IntoNodeIdentifiers for Reversed<G>