Trait IntoEdgeReferences 

pub trait IntoEdgeReferences: Data + GraphRef {
    type EdgeRef: EdgeRef<NodeId = Self::NodeId, EdgeId = Self::EdgeId, Weight = Self::EdgeWeight>;
    type EdgeReferences: Iterator<Item = Self::EdgeRef>;

    // Required method
    fn edge_references(self) -> Self::EdgeReferences;
}

Access to the sequence of the graph’s edges

Required 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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<'a, G> IntoEdgeReferences for &'a G

where G: IntoEdgeReferences,

type EdgeRef = <G as IntoEdgeReferences>::EdgeRef

type EdgeReferences = <G as IntoEdgeReferences>::EdgeReferences

fn edge_references(self) -> Self::EdgeReferences

Implementors

impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G>

where G: IntoEdgeReferences,

type EdgeRef = <G as IntoEdgeReferences>::EdgeRef

type EdgeReferences = <G as IntoEdgeReferences>::EdgeReferences

impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F>

where G: IntoEdgeReferences, F: FilterEdge<G::EdgeRef>,

type EdgeRef = <G as IntoEdgeReferences>::EdgeRef

type EdgeReferences = EdgeFilteredEdges<'a, G, <G as IntoEdgeReferences>::EdgeReferences, F>

impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F>

where G: IntoEdgeReferences, F: FilterNode<G::NodeId>,

type EdgeRef = <G as IntoEdgeReferences>::EdgeRef

type EdgeReferences = NodeFilteredEdgeReferences<'a, G, <G as IntoEdgeReferences>::EdgeReferences, F>

impl<'a, Ix: IndexType, E> IntoEdgeReferences for &'a List<E, Ix>

type EdgeRef = EdgeReference<'a, E, Ix>

type EdgeReferences = EdgeReferences<'a, E, Ix>

impl<'a, N, E, Ix: IndexType> IntoEdgeReferences for &'a Acyclic<DiGraph<N, E, Ix>>

type EdgeRef = <&'a Graph<N, E, Directed, Ix> as IntoEdgeReferences>::EdgeRef

type EdgeReferences = <&'a Graph<N, E, Directed, Ix> as IntoEdgeReferences>::EdgeReferences

impl<'a, N, E, Ix: IndexType> IntoEdgeReferences for &'a Acyclic<StableDiGraph<N, E, Ix>>

type EdgeRef = <&'a StableGraph<N, E, Directed, Ix> as IntoEdgeReferences>::EdgeRef

type EdgeReferences = <&'a StableGraph<N, E, Directed, Ix> as IntoEdgeReferences>::EdgeReferences

impl<'a, N, E, S, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> IntoEdgeReferences for &'a MatrixGraph<N, E, S, Ty, Null, Ix>

type EdgeRef = (NodeIndex<Ix>, NodeIndex<Ix>, &'a E)

type EdgeReferences = EdgeReferences<'a, Ty, Null, Ix>

impl<'a, N, E, Ty, Ix> IntoEdgeReferences for &'a Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type EdgeRef = EdgeReference<'a, E, Ty, Ix>

type EdgeReferences = EdgeReferences<'a, E, Ty, Ix>

impl<'a, N, E: 'a, Ty, S> IntoEdgeReferences for &'a GraphMap<N, E, Ty, S>

where N: NodeTrait + 'a, Ty: EdgeType, S: BuildHasher,

type EdgeRef = (N, N, &'a E)

type EdgeReferences = AllEdges<'a, N, E, Ty>

impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a Graph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type EdgeRef = EdgeReference<'a, E, Ix>

type EdgeReferences = EdgeReferences<'a, E, Ix>

impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type EdgeRef = EdgeReference<'a, E, Ix>

type EdgeReferences = EdgeReferences<'a, E, Ix>

impl<G> IntoEdgeReferences for Reversed<G>

where G: IntoEdgeReferences,

type EdgeRef = ReversedEdgeReference<<G as IntoEdgeReferences>::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<<G as IntoEdgeReferences>::EdgeReferences>

impl<G> IntoEdgeReferences for UndirectedAdaptor<G>

where G: IntoEdgeReferences,

type EdgeRef = MaybeReversedEdgeReference<<G as IntoEdgeReferences>::EdgeRef>

type EdgeReferences = MaybeReversedEdgeReferences<<G as IntoEdgeReferences>::EdgeReferences>