Trait Data 

pub trait Data: GraphBase {
    type NodeWeight;
    type EdgeWeight;
}

Define associated data for nodes and edges

Required Associated Types

type NodeWeight

type EdgeWeight

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<'a, G> Data for &'a G

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<'a, G> Data for &'a mut G

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

Implementors

impl<'a, G> Data for Frozen<'a, G>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<E, Ix: IndexType> Data for List<E, Ix>

type NodeWeight = ()

type EdgeWeight = E

impl<G, F> Data for EdgeFiltered<G, F>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<G, F> Data for NodeFiltered<G, F>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<G: Visitable + Data> Data for Acyclic<G>

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<G> Data for Reversed<G>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

impl<G> Data for UndirectedAdaptor<G>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

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

type NodeWeight = N

type EdgeWeight = E

impl<N, E, Ty, Ix> Data for Csr<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeWeight = N

type EdgeWeight = E

impl<N, E, Ty, Ix> Data for Graph<N, E, Ty, Ix>

where Ix: IndexType,

type NodeWeight = N

type EdgeWeight = E

impl<N, E, Ty, Ix> Data for StableGraph<N, E, Ty, Ix>

where Ty: EdgeType, Ix: IndexType,

type NodeWeight = N

type EdgeWeight = E

impl<N, E, Ty, S> Data for GraphMap<N, E, Ty, S>

where N: Copy + PartialEq, Ty: EdgeType, S: BuildHasher,

type NodeWeight = N

type EdgeWeight = E