Trait petgraph::visit::IntoNeighborsDirected[][src]

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

Required Methods

Implementations on Foreign Types

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