HyperGraphIterNode

Trait HyperGraphIterNode 

Source
pub trait HyperGraphIterNode<N, E, A>: HyperGraph<N, E, A>
where A: GraphProps,
{ type Nodes<'a>: Iterator<Item = (&'a VertexId<A::Ix>, &'a Self::Node<N>)> where Self: 'a, <Self as RawHyperGraph<A>>::Node<N>: 'a; type Verts<'a>: Iterator<Item = &'a VertexId<A::Ix>> where Self: 'a; // Required methods fn iter_nodes(&self) -> Self::Nodes<'_>; fn vertices(&self) -> Self::Verts<'_>; }
Expand description

The HyperGraphIterNode trait extends the HyperGraph trait to provide iterators over the nodes in the hypergraph.

Required Associated Types§

Source

type Nodes<'a>: Iterator<Item = (&'a VertexId<A::Ix>, &'a Self::Node<N>)> where Self: 'a, <Self as RawHyperGraph<A>>::Node<N>: 'a

Source

type Verts<'a>: Iterator<Item = &'a VertexId<A::Ix>> where Self: 'a

Required Methods§

Source

fn iter_nodes(&self) -> Self::Nodes<'_>

returns an iterator over the nodes of the graph

Source

fn vertices(&self) -> Self::Verts<'_>

returns an iterators over the indices of the nodes within the graph

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.

Implementors§