Graph.ConflictStrategy

Some pre-defined conflict handlers for add.

struct Graph(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)

static

struct ConflictStrategy {

static Edge sumWeights(Edge existingEdge, Edge newEdge);

static inout(Edge) error(inout(Edge) existingEdge, inout(Edge) newEdge);

static inout(Edge) replace(inout(Edge) existingEdge, inout(Edge) newEdge);

static inout(Edge) keep(inout(Edge) existingEdge, inout(Edge) newEdge);

}

Members

Static functions

error inout(Edge) error(inout(Edge) existingEdge, inout(Edge) newEdge): Throw EdgeExistsException.
keep inout(Edge) keep(inout(Edge) existingEdge, inout(Edge) newEdge): Keep existingEdge – discard newEdge.
replace inout(Edge) replace(inout(Edge) existingEdge, inout(Edge) newEdge): Replace the existingEdge by newEdge.
sumWeights Edge sumWeights(Edge existingEdge, Edge newEdge): Return an edge with sum of both weights. If given payload will be kept from existingEdge .

Meta

Source

See Implementation

dalicious math Graph constructors

this

functions

properties

static functions

edge

structs