Struct traitgraph::algo::traversal::BackwardNeighborStrategy [−][src]
pub struct BackwardNeighborStrategy;
Expand description
A neighbor strategy that traverses all incoming edges of a node.
Trait Implementations
impl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy
impl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy
type Iterator = Graph::InNeighbors
type Iterator = Graph::InNeighbors
The iterator type used to iterate over the neighbors of a node.
type EdgeNeighborIterator = Once<Graph::NodeIndex>
type EdgeNeighborIterator = Once<Graph::NodeIndex>
The iterator type used to iterate over the neighbors of an edge.
Returns an iterator over the neighbors of a given node.
fn edge_neighbor_iterator(
graph: &'a Graph,
edge: Graph::EdgeIndex
) -> Self::EdgeNeighborIterator
fn edge_neighbor_iterator(
graph: &'a Graph,
edge: Graph::EdgeIndex
) -> Self::EdgeNeighborIterator
Returns an iterator over the neighbors of an edge.