Trait daggy::petgraph::visit::Externals

pub trait Externals<'a>: Graphlike where Self::Externals::Item == Self::NodeId {
    type Externals: Iterator;
    fn externals(&'a self, d: EdgeDirection) -> Self::Externals;
}

Externals returns an iterator of all nodes that either have either no incoming or no outgoing edges.

Associated Types

type Externals: Iterator

Required Methods

fn externals(&'a self, d: EdgeDirection) -> Self::Externals

Return an iterator of all nodes with no edges in the given direction

Implementors

• impl<'a, N, E, Ty, Ix> Externals<'a> for Graph<N, E, Ty, Ix> where Ix: IndexType, N: 'a, Ty: EdgeType
• impl<'a, 'b, G> Externals<'a> for Reversed<&'b G> where G: Externals<'a>