Trait petgraph::visit::Data

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

Define associated data for nodes and edges

Required Associated Types

type NodeWeight

type EdgeWeight

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> Data for Reversed<G>

where G: Data,

type NodeWeight = <G as Data>::NodeWeight

type EdgeWeight = <G as Data>::EdgeWeight

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

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

type NodeWeight = N

type EdgeWeight = E