[−][src]Trait petgraph::visit::IntoEdgeReferences
Access to the sequence of the graph’s edges
Associated Types
type EdgeRef: EdgeRef<NodeId = Self::NodeId, EdgeId = Self::EdgeId, Weight = Self::EdgeWeight>
type EdgeReferences: Iterator<Item = Self::EdgeRef>
Required methods
fn edge_references(self) -> Self::EdgeReferences
Implementations on Foreign Types
impl<'a, G> IntoEdgeReferences for &'a G where
G: IntoEdgeReferences,
[src]
G: IntoEdgeReferences,
type EdgeRef = G::EdgeRef
type EdgeReferences = G::EdgeReferences
fn edge_references(self) -> Self::EdgeReferences
[src]
Implementors
impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G> where
G: IntoEdgeReferences,
[src]
G: IntoEdgeReferences,
type EdgeRef = G::EdgeRef
type EdgeReferences = G::EdgeReferences
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where
G: IntoEdgeReferences,
F: FilterEdge<G::EdgeRef>,
[src]
G: IntoEdgeReferences,
F: FilterEdge<G::EdgeRef>,
type EdgeRef = G::EdgeRef
type EdgeReferences = EdgeFilteredEdges<'a, G, G::EdgeReferences, F>
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F> where
G: IntoEdgeReferences,
F: FilterNode<G::NodeId>,
[src]
G: IntoEdgeReferences,
F: FilterNode<G::NodeId>,
type EdgeRef = G::EdgeRef
type EdgeReferences = NodeFilteredEdgeReferences<'a, G, G::EdgeReferences, F>
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, N, E, Ty, Ix> IntoEdgeReferences for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
type EdgeRef = EdgeReference<'a, E, Ty, Ix>
type EdgeReferences = EdgeReferences<'a, E, Ty, Ix>
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, N: 'a, E: 'a, Ty> IntoEdgeReferences for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
[src]
N: NodeTrait,
Ty: EdgeType,
type EdgeRef = (N, N, &'a E)
type EdgeReferences = AllEdges<'a, N, E, Ty>
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
type EdgeRef = EdgeReference<'a, E, Ix>
type EdgeReferences = EdgeReferences<'a, E, Ix>
fn edge_references(self) -> Self::EdgeReferences
[src]
impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
[src]
Ty: EdgeType,
Ix: IndexType,
type EdgeRef = EdgeReference<'a, E, Ix>
type EdgeReferences = EdgeReferences<'a, E, Ix>
fn edge_references(self) -> Self::EdgeReferences
[src]
Create an iterator over all edges in the graph, in indexed order.
Iterator element type is EdgeReference<E, Ix>
.
impl<G> IntoEdgeReferences for Reversed<G> where
G: IntoEdgeReferences,
[src]
G: IntoEdgeReferences,