Struct daggy::petgraph::graphmap::Edges

pub struct Edges<'a, N, E> where E: 'a, N: 'a + NodeTrait {
    pub from: N,
    pub edges: &'a HashMap<(N, N), E, RandomState>,
    pub iter: Neighbors<'a, N>,
}

Fields

from: N

Deprecated: should be private

edges: &'a HashMap<(N, N), E, RandomState>

Deprecated: should be private

iter: Neighbors<'a, N>

Deprecated: should be private

Trait Implementations

impl<'a, N, E> Iterator for Edges<'a, N, E> where E: 'a, N: 'a + NodeTrait

type Item = (N, &'a E)

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