Trait petgraph::visit::IntoNeighborsDirected

pub trait IntoNeighborsDirected: IntoNeighbors {
    type NeighborsDirected: Iterator<Item = Self::NodeId>;
    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.

Associated Types

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

Loading content...

Required methods

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

Loading content...

Implementations on Foreign Types

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

type NeighborsDirected = G::NeighborsDirected

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

Loading content...

Implementors

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

type NeighborsDirected = G::NeighborsDirected

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

impl<'a, G, F> IntoNeighborsDirected for &'a EdgeFiltered<G, F> where
    G: IntoEdgesDirected,
    F: FilterEdge<G::EdgeRef>, 

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

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

impl<'a, G, F> IntoNeighborsDirected for &'a NodeFiltered<G, F> where
    G: IntoNeighborsDirected,
    F: FilterNode<G::NodeId>, 

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

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

impl<'a, N, E: 'a, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoNeighborsDirected for &'a MatrixGraph<N, E, Directed, Null, Ix>

type NeighborsDirected = Neighbors<'a, Directed, Null, Ix>

fn neighbors_directed(
    self,
    a: NodeIndex<Ix>,
    d: Direction
) -> Self::NeighborsDirected

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>

Important traits for Neighbors<'a, E, Ix>

impl<'a, E, Ix> Iterator for Neighbors<'a, E, Ix> where
    Ix: IndexType,  type Item = NodeIndex<Ix>;

fn neighbors_directed(
    self,
    n: NodeIndex<Ix>,
    d: Direction
) -> Neighbors<'a, E, Ix>

impl<'a, N, E: 'a, Ty, Ix> IntoNeighborsDirected for &'a StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

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

fn neighbors_directed(
    self,
    n: NodeIndex<Ix>,
    d: Direction
) -> Self::NeighborsDirected

impl<'a, N: 'a, E, Ty> IntoNeighborsDirected for &'a GraphMap<N, E, Ty> where
    N: Copy + Ord + Hash,
    Ty: EdgeType, 

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

fn neighbors_directed(self, n: N, dir: Direction) -> Self::NeighborsDirected

impl<G> IntoNeighborsDirected for Reversed<G> where
    G: IntoNeighborsDirected, 

type NeighborsDirected = G::NeighborsDirected

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

Loading content...