Trait petgraph::visit::GraphBase[−][src]

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

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

Associated Types

type EdgeId: Copy + PartialEq[src]

edge identifier

type NodeId: Copy + PartialEq[src]

node identifier

Loading content...

Implementations on Foreign Types

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

type NodeId = G::NodeId

type EdgeId = G::EdgeId

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

type NodeId = G::NodeId

type EdgeId = G::EdgeId

Loading content...

Implementors

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

type NodeId = G::NodeId

type EdgeId = G::EdgeId

impl<G, F> GraphBase for EdgeFiltered<G, F> where
    G: GraphBase, [src]

type NodeId = G::NodeId

type EdgeId = G::EdgeId

impl<G, F> GraphBase for NodeFiltered<G, F> where
    G: GraphBase, [src]

type NodeId = G::NodeId

type EdgeId = G::EdgeId

impl<G: GraphBase> GraphBase for Reversed<G>[src]

type NodeId = G::NodeId

type EdgeId = G::EdgeId

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

type NodeId = N

type EdgeId = (N, N)

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

type NodeId = NodeIndex<Ix>

type EdgeId = EdgeIndex

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

type NodeId = NodeIndex<Ix>

type EdgeId = EdgeIndex<Ix>

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

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

type NodeId = NodeIndex<Ix>

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

Loading content...