Struct daggy::petgraph::graph::Edges

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

Iterator over the edges of a node.

Trait Implementations

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

type Item = (NodeIndex<Ix>, &'a E)

fn next(&mut self) -> Option<(NodeIndex<Ix>, &'a E)>