Trait petgraph::visit::IntoEdges

pub trait IntoEdges: IntoEdgeReferences + IntoNeighbors {
    type Edges: Iterator<Item = Self::EdgeRef>;
    fn edges(self, a: Self::NodeId) -> Self::Edges;
}

Access to the edges of each node.

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

• Directed: All edges from a.
• Undirected: All edges connected to a.

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

Associated Types

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

Required Methods

fn edges(self, a: Self::NodeId) -> Self::Edges

Implementations on Foreign Types

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

type Edges = G::Edges

fn edges(self, a: Self::NodeId) -> Self::Edges

Implementors

• impl<'a, G, F> IntoEdges for &'a NodeFiltered<G, F> where
    G: IntoEdges,
    F: FilterNode<G::NodeId>,  type Edges = NodeFilteredEdges<'a, G, G::Edges, F>;
• impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F> where
    G: IntoEdges,
    F: FilterEdge<G::EdgeRef>,  type Edges = EdgeFilteredEdges<'a, G, G::Edges, F>;
• impl<'a, N: 'a, E: 'a, Ty> IntoEdges for &'a GraphMap<N, E, Ty> where
    N: NodeTrait,
    Ty: EdgeType,  type Edges = Edges<'a, N, E, Ty>;
• impl<'a, N, E, Ty, Ix> IntoEdges for &'a StableGraph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type Edges = Edges<'a, E, Ty, Ix>;
• impl<'a, 'b, G> IntoEdges for &'b Frozen<'a, G> where
    G: IntoEdges,  type Edges = G::Edges;
• impl<'a, N, E, Ty, Ix> IntoEdges for &'a Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type Edges = Edges<'a, E, Ty, Ix>;
• impl<'a, N, E, Ty, Ix> IntoEdges for &'a Csr<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType,  type Edges = Edges<'a, E, Ty, Ix>;