dalicious ~master (2019-07-04T14:03:58Z)
Dub
Repo
Graph.inDegree
dalicious
math
Graph
Get the degree of node
n
.
size_t
inDegree
(
Node
n
)
alias
inDegree
=
degree
struct
Graph
(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
alias
inDegree
=
degree
size_t
degree
(
Node
n
)
alias
outDegree
=
degree
Meta
Source
See Implementation
dalicious
math
Graph
constructors
this
functions
adjacencyList
bulkAddForce
degree
forceAdd
get
has
inDegree
inEdges
incidentEdges
indexOf
opBinaryRight
opOpAssign
outDegree
outEdges
replaceEdge
properties
edges
nodes
static functions
edge
structs
ConflictStrategy
Edge
Get the degree of node n.