pub struct UndirectedNeighborStrategy;Expand description
A neighbor strategy that traverses all incoming and all outgoing edges of a node.
Trait Implementations
sourceimpl<'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.
type EdgeNeighborIterator = Chain<Once<Graph::NodeIndex>, Once<Graph::NodeIndex>>
type EdgeNeighborIterator = Chain<Once<Graph::NodeIndex>, Once<Graph::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 UndirectedNeighborStrategy
impl Send for UndirectedNeighborStrategy
impl Sync for UndirectedNeighborStrategy
impl Unpin for UndirectedNeighborStrategy
impl UnwindSafe for UndirectedNeighborStrategy
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more