dalicious ~master (2022-03-10T20:55:15.5110933)
Dub
Repo
Graph.bulkAddForce
dalicious
math
Graph
Add a set of edges to this graph without any checks.
struct
Graph
(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
void
bulkAddForce
(
R
)
(
R
edges
)
if
(
isForwardRange
!
R
&&
is
(
ElementType
!
R
==
Edge
)
)
Meta
Source
See Implementation
dalicious
math
Graph
constructors
this
functions
adjacencyList
allDegrees
allIncidentEdges
bulkAddForce
degree
forceAdd
get
has
inDegree
inEdges
incidentEdges
indexOf
opBinaryRight
opOpAssign
outDegree
outEdges
replaceEdge
postblits
this(this)
properties
edges
nodes
static functions
edge
groupByNodes
orderByNodes
static variables
hasEdgePayload
isWeighted
structs
ConflictStrategy
DegreesCache
Edge
IncidentEdgesCache
variables
_edges
_nodes
Add a set of edges to this graph without any checks.