Struct traitgraph_algo::traversal::BackwardNeighborStrategy

pub struct BackwardNeighborStrategy;

A neighbor strategy that traverses all incoming edges of a node.

Trait Implementations

impl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy

type Iterator = <Graph as NavigableGraph<'a>>::InNeighbors

The iterator type used to iterate over the neighbors of a node.

type EdgeNeighborIterator = Once<<Graph as GraphBase>::NodeIndex>

The iterator type used to iterate over the neighbors of an edge.

fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator

Returns an iterator over the neighbors of a given node.

fn edge_neighbor_iterator( graph: &'a Graph, edge: Graph::EdgeIndex ) -> Self::EdgeNeighborIterator

Returns an iterator over the neighbors of an edge.