Trait petgraph::visit::GraphBase

source ·
pub trait GraphBase {
    type EdgeId: Copy + PartialEq;
    type NodeId: Copy + PartialEq;
}
Expand description

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

Required Associated Types§

source

type EdgeId: Copy + PartialEq

edge identifier

source

type NodeId: Copy + PartialEq

node identifier

Object Safety§

This trait is not object safe.

Implementations on Foreign Types§

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

Implementors§

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

source§

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

§

type NodeId = Ix

§

type EdgeId = EdgeIndex<Ix>

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

source§

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

§

type NodeId = <G as GraphBase>::NodeId

§

type EdgeId = <G as GraphBase>::EdgeId

source§

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

§

type NodeId = Ix

§

type EdgeId = usize

source§

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

§

type NodeId = NodeIndex<Ix>

§

type EdgeId = EdgeIndex<Ix>

source§

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

§

type NodeId = NodeIndex<Ix>

§

type EdgeId = EdgeIndex<Ix>

source§

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

§

type NodeId = N

§

type EdgeId = (N, N)

source§

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>)