Trait petgraph::visit::NeighborsDirected

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

NeighborsDirected gives access to neighbors of both Incoming and Outgoing edges of a node.

Associated Types

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

Required Methods

fn neighbors_directed(
    &'a self,
    n: Self::NodeId,
    d: EdgeDirection
) -> Self::NeighborsDirected

Return an iterator that visits all neighbors of the node n.

Implementors

• impl<'a, N, E: 'a, Ty, Ix> NeighborsDirected<'a> for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type NeighborsDirected = Neighbors<'a, E, Ix>;
• impl<'a, 'b, G> NeighborsDirected<'a> for Reversed<&'b G> where
    G: NeighborsDirected<'a>,  type NeighborsDirected = <G as NeighborsDirected<'a>>::NeighborsDirected;