Struct daggy::petgraph::graph::Neighbors

pub struct Neighbors<'a, E, Ix = u32> where E: 'a, Ix: 'a + IndexType {
    // some fields omitted
}

Iterator over the neighbors of a node.

Iterator element type is NodeIndex.

Trait Implementations

impl<'a, E, Ix> Iterator for Neighbors<'a, E, Ix> where Ix: IndexType

type Item = NodeIndex<Ix>

fn next(&mut self) -> Option<NodeIndex<Ix>>