Trait petgraph::visit::IntoEdgeReferences

source ·
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;
}
Expand description

Access to the sequence of the graph’s edges

Required Associated Types§

source

type EdgeRef: EdgeRef<NodeId = Self::NodeId, EdgeId = Self::EdgeId, Weight = Self::EdgeWeight>

source

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

Required Methods§

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

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

Implementors§

source§

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

source§

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

source§

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

source§

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

§

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

§

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

source§

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>

source§

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

§

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

§

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

source§

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>

source§

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>

source§

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>

source§

impl<G> IntoEdgeReferences for Reversed<G>