Struct traitgraph_algo::traversal::UndirectedNeighborStrategy

pub struct UndirectedNeighborStrategy;

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

Trait Implementations

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

type Iterator = Chain<<<Graph as NavigableGraph<'a>>::OutNeighbors as IntoIterator>::IntoIter, <<Graph as NavigableGraph<'a>>::InNeighbors as IntoIterator>::IntoIter>

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

type EdgeNeighborIterator = Chain<Once<<Graph as GraphBase>::NodeIndex>, 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.