Trait petgraph::visit::GraphBase

pub trait GraphBase {
    type EdgeId: Copy + PartialEq;
    type NodeId: Copy + PartialEq;
}

Base graph trait: defines the associated node identifier and edge identifier types.

Required Associated Types

type EdgeId: Copy + PartialEq

edge identifier

type NodeId: Copy + PartialEq

node identifier

Implementations on Foreign Types

impl<'a, G> GraphBase for &'a mut Gwhere G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

impl<'a, G> GraphBase for &'a Gwhere G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

Implementors

impl<'a, G> GraphBase for Frozen<'a, G>where G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

impl<E, Ix> GraphBase for List<E, Ix>where Ix: IndexType,

type NodeId = Ix

type EdgeId = EdgeIndex<Ix>

impl<G, F> GraphBase for EdgeFiltered<G, F>where G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

impl<G, F> GraphBase for NodeFiltered<G, F>where G: GraphBase,

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

impl<G: GraphBase> GraphBase for Reversed<G>

type NodeId = <G as GraphBase>::NodeId

type EdgeId = <G as GraphBase>::EdgeId

impl<N, E, Ty> GraphBase for GraphMap<N, E, Ty>where N: Copy + PartialEq,

type NodeId = N

type EdgeId = (N, N)

impl<N, E, Ty, Ix> GraphBase for Csr<N, E, Ty, Ix>where Ty: EdgeType, Ix: IndexType,

type NodeId = Ix

type EdgeId = usize

impl<N, E, Ty, Ix> GraphBase for Graph<N, E, Ty, Ix>where Ix: IndexType,

type NodeId = NodeIndex<Ix>

type EdgeId = EdgeIndex<Ix>

impl<N, E, Ty, Ix> GraphBase for StableGraph<N, E, Ty, Ix>where Ix: IndexType,

type NodeId = NodeIndex<Ix>

type EdgeId = EdgeIndex<Ix>

impl<N, E, Ty: EdgeType, Null: Nullable<Wrapped = E>, Ix: IndexType> GraphBase for MatrixGraph<N, E, Ty, Null, Ix>

type NodeId = NodeIndex<Ix>

type EdgeId = (NodeIndex<Ix>, NodeIndex<Ix>)