Struct traitgraph::algo::traversal::UndirectedNeighborStrategy [−][src]
pub struct UndirectedNeighborStrategy;
Expand description
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
impl<'a, Graph: NavigableGraph<'a> + ImmutableGraphContainer> TraversalNeighborStrategy<'a, Graph> for UndirectedNeighborStrategy
type Iterator = Chain<<Graph::OutNeighbors as IntoIterator>::IntoIter, <Graph::InNeighbors as IntoIterator>::IntoIter>
type Iterator = Chain<<Graph::OutNeighbors as IntoIterator>::IntoIter, <Graph::InNeighbors as IntoIterator>::IntoIter>
The iterator type used to iterate over the neighbors of a node.
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.