Trait petgraph::visit::IntoNeighborsDirected

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

Access to the neighbors of each node, through incoming or outgoing edges.

Associated Types

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

Required Methods

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

Implementors

• impl<G> IntoNeighborsDirected for Reversed<G> where G: IntoNeighborsDirected
• impl<'a, N, E: 'a, Ty, Ix> IntoNeighborsDirected for &'a Graph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, N, E: 'a, Ty, Ix> IntoNeighborsDirected for &'a StableGraph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, N: 'a, E, Ty> IntoNeighborsDirected for &'a GraphMap<N, E, Ty> where N: Copy + Ord + Hash, Ty: EdgeType
• impl<'a, G> IntoNeighborsDirected for &'a G where G: Copy + IntoNeighborsDirected