Trait petgraph::visit::IntoEdgesDirected [−][src]
pub trait IntoEdgesDirected: IntoEdges + IntoNeighborsDirected { type EdgesDirected: Iterator<Item = Self::EdgeRef>; 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 froma.Directed,Incoming: All edges toa.Undirected,Outgoing: All edges connected toa, withabeing the source of each edge.Undirected,Incoming: All edges connected toa, withabeing the target of each edge.
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>[src]
Required methods
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected[src]
Implementations on Foreign Types
impl<'a, G> IntoEdgesDirected for &'a G where
G: IntoEdgesDirected, [src]
impl<'a, G> IntoEdgesDirected for &'a G where
G: IntoEdgesDirected, [src]type EdgesDirected = G::EdgesDirected
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected[src]
Implementors
impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G> where
G: IntoEdgesDirected, [src]
impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G> where
G: IntoEdgesDirected, [src]type EdgesDirected = G::EdgesDirected
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected[src]
impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]
impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]type EdgesDirected = Edges<'a, E, Ty, Ix>
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected[src]
impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]
impl<'a, N, E, Ty, Ix> IntoEdgesDirected for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType, [src]type EdgesDirected = Edges<'a, E, Ty, Ix>
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected[src]
impl<G> IntoEdgesDirected for Reversed<G> where
G: IntoEdgesDirected, [src]
impl<G> IntoEdgesDirected for Reversed<G> where
G: IntoEdgesDirected, [src]