Trait petgraph::visit::NeighborIter
[−]
[src]
pub trait NeighborIter<'a>: Graphlike { type Iter: Iterator<Item=Self::NodeId>; fn neighbors(&'a self, n: Self::NodeId) -> Self::Iter; }
A graph trait for accessing the neighbors iterator
Associated Types
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 Ty: EdgeType, Ix: IndexType
impl<'a, N, E> NeighborIter<'a> for GraphMap<N, E> where N: Copy + Clone + Ord + Hash + Eq
impl<'a, 'b, N, E, Ty, Ix> NeighborIter<'a> for AsUndirected<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType
impl<'a, 'b, N, E, Ty, Ix> NeighborIter<'a> for Reversed<&'b Graph<N, E, Ty, Ix>> where Ty: EdgeType, Ix: IndexType