pub trait DiNeighIterable<D>where
D: Digraph,{
// Required methods
fn in_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ;
fn out_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ;
}Expand description
Allows construction of a DiNeighIterator.
Has a default implementation for Digraph.
Required Methods§
Sourcefn in_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ
fn in_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ
Returns a DiNeighIterator over all in-neighbourhoods of this graph.
Sourcefn out_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ
fn out_neighbourhoods(&self) -> DiNeighIterator<'_, D> ⓘ
Returns a DiNeighIterator over all out-neighbourhoods of this graph.