Trait petgraph::visit::IntoEdgesDirected

source ·
pub trait IntoEdgesDirected: IntoEdges + IntoNeighborsDirected {
    type EdgesDirected: Iterator<Item = Self::EdgeRef>;

    // Required method
    fn edges_directed(
        self,
        a: Self::NodeId,
        dir: Direction,
    ) -> Self::EdgesDirected;
}
Expand description

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).

Required Associated Types§

Required Methods§

source

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

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

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

Implementors§

source§

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

source§

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>

source§

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>