Trait daggy::petgraph::visit::NeighborIter

pub trait NeighborIter<'a>: Graphlike where Self::Iter::Item == Self::NodeId {
    type Iter: Iterator;
    fn neighbors(&'a self, n: Self::NodeId) -> Self::Iter;
}

NeighborIter gives access to the neighbors iterator.

Associated Types

type Iter: Iterator

Required Methods

fn neighbors(&'a self, n: Self::NodeId) -> Self::Iter

Return an iterator that visits all neighbors of the node n.

Implementors

• impl<'a, N, E, Ty, Ix> NeighborIter<'a> for Graph<N, E, Ty, Ix> where E: 'a, Ix: IndexType, Ty: EdgeType
• impl<'a, N, E> NeighborIter<'a> for GraphMap<N, E> where N: 'a + Copy + Ord + Hash
• impl<'a, 'b, N, E, Ty, Ix> NeighborIter<'a> for AsUndirected<&'b Graph<N, E, Ty, Ix>> where E: 'a, Ix: IndexType, Ty: EdgeType
• impl<'a, 'b, N, E, Ty, Ix> NeighborIter<'a> for Reversed<&'b Graph<N, E, Ty, Ix>> where E: 'a, Ix: IndexType, Ty: EdgeType