Trait petgraph::visit::IntoEdgesDirected

pub trait IntoEdgesDirected: IntoEdges + IntoNeighborsDirected {
    type EdgesDirected: Iterator<Item = Self::EdgeRef>;
    fn edges_directed(
        self, 
        a: Self::NodeId, 
        dir: Direction
    ) -> Self::EdgesDirected;
}

Access to all edges of each node, in the specified direction.

The edges are, depending on the direction and the graph’s edge type:

• Directed, Outgoing: All edges from a.
• Directed, Incoming: All edges to a.
• Undirected: All edges connected to a.

This is an extended version of the trait IntoNeighborsDirected; the former only iterates over the target node identifiers, while this trait yields edge references (trait EdgeRef).

Associated Types

type EdgesDirected: Iterator<Item = Self::EdgeRef>

Required Methods

fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected

Implementations on Foreign Types

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

type EdgesDirected = G::EdgesDirected

fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected

Implementors

• impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a StableGraph<N, E, Ty, Ix> where     Ty: EdgeType,     Ix: IndexType,  type EdgesDirected = Edges<'a, E, Ty, Ix>;

• impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G> where     G: IntoEdgesDirected,  type EdgesDirected = G::EdgesDirected;

• impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a Graph<N, E, Ty, Ix> where     Ty: EdgeType,     Ix: IndexType,  type EdgesDirected = Edges<'a, E, Ty, Ix>;