Trait petgraph::visit::IntoExternals

pub trait IntoExternals: GraphRef {
    type Externals: Iterator<Item=Self::NodeId>;
    fn externals(self, d: EdgeDirection) -> Self::Externals;
}

Access to the graph’s nodes without edges to them (Incoming) or from them (Outgoing).

Associated Types

type Externals: Iterator<Item=Self::NodeId>

Required Methods

fn externals(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> IntoExternals for &'a Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<G> IntoExternals for Reversed<G> where G: IntoExternals