Trait petgraph::visit::IntoEdgeReferences

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>

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

Required Methods

fn edge_references(self) -> Self::EdgeReferences

Implementors

• impl<'a, G, F> IntoEdgeReferences for &'a NodeFiltered<G, F> where G: IntoEdgeReferences, F: FilterNode<G::NodeId>
• impl<'a, G, F> IntoEdgeReferences for &'a EdgeFiltered<G, F> where G: IntoEdgeReferences, F: FilterEdge<G::EdgeRef>
• impl<G> IntoEdgeReferences for Reversed<G> where G: IntoEdgeReferences
• impl<'a, G> IntoEdgeReferences for &'a G where G: IntoEdgeReferences
• 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> IntoEdgeReferences for &'a GraphMap<N, E, Ty> where N: NodeTrait, Ty: EdgeType
• impl<'a, N: 'a, E: 'a, Ty, Ix> IntoEdgeReferences for &'a StableGraph<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType
• impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G> where G: IntoEdgeReferences
• impl<'a, N, E, Ty, Ix> IntoEdgeReferences for &'a Csr<N, E, Ty, Ix> where Ty: EdgeType, Ix: IndexType