Trait petgraph::visit::IntoEdges
[−]
[src]
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 froma
.Undirected
: All edges connected toa
.
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
Required Methods
Implementors
impl<'a, G, F> IntoEdges for &'a NodeFiltered<G, F> where
G: IntoEdges,
F: FilterNode<G::NodeId>,impl<'a, G, F> IntoEdges for &'a EdgeFiltered<G, F> where
G: IntoEdges,
F: FilterEdge<G::EdgeRef>,impl<'a, G> IntoEdges for &'a G where
G: IntoEdges,impl<'a, N: 'a, E: 'a, Ty> IntoEdges for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,impl<'a, N, E, Ty, Ix> IntoEdges for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,impl<'a, N, E, Ty, Ix> IntoEdges for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,impl<'a, 'b, G> IntoEdges for &'b Frozen<'a, G> where
G: IntoEdges,impl<'a, N, E, Ty, Ix> IntoEdges for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,