Trait IntoNeighborsDirected 

pub trait IntoNeighborsDirected: IntoNeighbors {
    type NeighborsDirected: Iterator<Item = Self::NodeId>;

    // Required method
    fn neighbors_directed(
        self,
        n: Self::NodeId,
        d: Direction,
    ) -> Self::NeighborsDirected;
}

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

Depending on the graph’s edge type, the neighbors of a given directionality are:

• Directed, Outgoing: All targets of edges from a.
• Directed, Incoming: All sources of edges to a.
• Undirected: All other endpoints of edges connected to a.

Required Associated Types

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

Required Methods

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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<'a, G> IntoNeighborsDirected for &'a G

where G: IntoNeighborsDirected,

type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected

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

Implementors

impl<'a, 'b, G> IntoNeighborsDirected for &'b Frozen<'a, G>

where G: IntoNeighborsDirected,

type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected

impl<'a, G, F> IntoNeighborsDirected for &'a EdgeFiltered<G, F>

where G: IntoEdgesDirected, F: FilterEdge<G::EdgeRef>,

type NeighborsDirected = EdgeFilteredNeighborsDirected<'a, G, F>

impl<'a, G, F> IntoNeighborsDirected for &'a NodeFiltered<G, F>

where G: IntoNeighborsDirected, F: FilterNode<G::NodeId>,

type NeighborsDirected = NodeFilteredNeighbors<'a, <G as IntoNeighborsDirected>::NeighborsDirected, F>

impl<'a, N, E, Ix: IndexType> IntoNeighborsDirected for &'a Acyclic<DiGraph<N, E, Ix>>

type NeighborsDirected = <&'a Graph<N, E, Directed, Ix> as IntoNeighborsDirected>::NeighborsDirected

impl<'a, N, E, Ty, S> IntoNeighborsDirected for &'a GraphMap<N, E, Ty, S>

where N: Copy + Ord + Hash + 'a, Ty: EdgeType, S: BuildHasher,

type NeighborsDirected = NeighborsDirected<'a, N, Ty>

impl<'a, N, E: 'a, Ty, Ix> IntoNeighborsDirected for &'a Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NeighborsDirected = Neighbors<'a, E, Ix>

impl<G> IntoNeighborsDirected for Reversed<G>

where G: IntoNeighborsDirected,

type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected