Trait petgraph::data::Build

pub trait Build: Data + NodeCount {
    // Required methods
    fn add_node(&mut self, weight: Self::NodeWeight) -> Self::NodeId;
    fn update_edge(
        &mut self,
        a: Self::NodeId,
        b: Self::NodeId,
        weight: Self::EdgeWeight
    ) -> Self::EdgeId;

    // Provided method
    fn add_edge(
        &mut self,
        a: Self::NodeId,
        b: Self::NodeId,
        weight: Self::EdgeWeight
    ) -> Option<Self::EdgeId> { ... }
}

A graph that can be extended with further nodes and edges

Required Methods

fn add_node(&mut self, weight: Self::NodeWeight) -> Self::NodeId

fn update_edge(
&mut self,
a: Self::NodeId,
b: Self::NodeId,
weight: Self::EdgeWeight
) -> Self::EdgeId

Add or update the edge from a to b. Return the id of the affected edge.

Provided Methods

fn add_edge(
&mut self,
a: Self::NodeId,
b: Self::NodeId,
weight: Self::EdgeWeight
) -> Option<Self::EdgeId>

Add a new edge. If parallel edges (duplicate) are not allowed and the edge already exists, return None.

Implementors

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

impl<N, E, Ty> Build for GraphMap<N, E, Ty>where
Ty: EdgeType,
N: NodeTrait,

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

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

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