Trait petgraph::visit::Externals

pub trait Externals<'a>: Graphlike {
    type Externals: Iterator<Item = Self::NodeId>;
    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<Item = Self::NodeId>

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: 'a, E, Ty, Ix> Externals<'a> for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type Externals = Externals<'a, N, Ty, Ix>;
• impl<'a, 'b, G> Externals<'a> for Reversed<&'b G> where
    G: Externals<'a>,  type Externals = <G as Externals<'a>>::Externals;