pub struct BackwardNeighborStrategy;Expand description
A neighbor strategy that traverses all incoming edges of a node.
Trait Implementations
sourceimpl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy
impl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for BackwardNeighborStrategy
type Iterator = <Graph as NavigableGraph<'a>>::InNeighbors
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>
type EdgeNeighborIterator = Once<<Graph as GraphBase>::NodeIndex>
The iterator type used to iterate over the neighbors of an edge.
sourcefn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
fn neighbor_iterator(graph: &'a Graph, node: Graph::NodeIndex) -> Self::Iterator
Returns an iterator over the neighbors of a given node.
sourcefn 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.
Auto Trait Implementations
impl RefUnwindSafe for BackwardNeighborStrategy
impl Send for BackwardNeighborStrategy
impl Sync for BackwardNeighborStrategy
impl Unpin for BackwardNeighborStrategy
impl UnwindSafe for BackwardNeighborStrategy
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more