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<Graph: NavigableGraph + ImmutableGraphContainer> TraversalNeighborStrategy<Graph> for UndirectedNeighborStrategy

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

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

type EdgeNeighborIterator<'a> where Graph: 'a = 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: &Graph, node: Graph::NodeIndex ) -> Self::Iterator<'_>

Returns an iterator over the neighbors of a given node.

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

Returns an iterator over the neighbors of an edge.