Struct daggy::petgraph::graph::WithoutEdges

pub struct WithoutEdges<'a, N, Ty, Ix = u32> where Ix: IndexType, N: 'a {
    // some fields omitted
}

An iterator over either the nodes without edges to them or from them.

Trait Implementations

impl<'a, N, Ty, Ix> Iterator for WithoutEdges<'a, N, Ty, Ix> where Ix: IndexType, N: 'a, Ty: EdgeType

type Item = NodeIndex<Ix>

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