Trait petgraph::visit::IntoEdgeReferences [−][src]
pub trait IntoEdgeReferences: Data + GraphRef { type EdgeRef: EdgeRef<NodeId = Self::NodeId, EdgeId = Self::EdgeId, Weight = Self::EdgeWeight>; type EdgeReferences: Iterator<Item = Self::EdgeRef>; fn edge_references(self) -> Self::EdgeReferences; }
Expand description
Access to the sequence of the graph’s edges
Associated Types
type EdgeReferences: Iterator<Item = Self::EdgeRef>
Required methods
fn edge_references(self) -> Self::EdgeReferences
Implementations on Foreign Types
type EdgeReferences = G::EdgeReferences
Implementors
impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where
G: IntoEdgeReferences,
F: FilterEdge<G::EdgeRef>,
impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F> where
G: IntoEdgeReferences,
F: FilterNode<G::NodeId>,
impl<'a, N, E, Ty, Ix> IntoEdgeReferences for &'a Csr<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoEdgeReferences for &'a MatrixGraph<N, E, Ty, Null, Ix>
impl<'a, N: 'a, E: 'a, Ty> IntoEdgeReferences for &'a GraphMap<N, E, Ty> where
N: NodeTrait,
Ty: EdgeType,
impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a Graph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,
impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a StableGraph<N, E, Ty, Ix> where
Ty: EdgeType,
Ix: IndexType,