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;
}

Access to the sequence of the graph’s edges

Associated Types

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

type EdgeReferences: Iterator<Item = Self::EdgeRef>[src]

Loading content...

Required methods

fn edge_references(self) -> Self::EdgeReferences[src]

Loading content...

Implementations on Foreign Types

impl<'a, G> IntoEdgeReferences for &'a G where
    G: IntoEdgeReferences, [src]

type EdgeRef = G::EdgeRef

type EdgeReferences = G::EdgeReferences

Loading content...

Implementors

impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G> where
    G: IntoEdgeReferences, [src]

type EdgeRef = G::EdgeRef

type EdgeReferences = G::EdgeReferences

impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where
    G: IntoEdgeReferences,
    F: FilterEdge<G::EdgeRef>, [src]

type EdgeRef = G::EdgeRef

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

impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F> where
    G: IntoEdgeReferences,
    F: FilterNode<G::NodeId>, [src]

type EdgeRef = G::EdgeRef

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

impl<'a, N, E, Ty, Ix> IntoEdgeReferences for &'a Csr<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, [src]

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

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

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

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

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

impl<'a, N: 'a, E: 'a, Ty> IntoEdgeReferences for &'a GraphMap<N, E, Ty> where
    N: NodeTrait,
    Ty: EdgeType, [src]

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, [src]

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, [src]

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]

type EdgeRef = ReversedEdgeReference<G::EdgeRef>

type EdgeReferences = ReversedEdgeReferences<G::EdgeReferences>

Loading content...