petgraph::visit

Trait IntoNodeReferences

Source
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§

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> 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: IndexType, E> IntoNodeReferences for &'a List<E, Ix>

Source§

impl<'a, N, E, Ty, Ix> IntoNodeReferences for &'a Csr<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, Ix> IntoNodeReferences for &'a StableGraph<N, E, Ty, Ix>
where Ty: EdgeType, Ix: IndexType,

Source§

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

Source§

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

Source§

impl<G> IntoNodeReferences for Reversed<G>