Index of each node's group (node.group), -1 for none; groups is the number of groups.
groups?
readonly
number
-
halfHeight
readonly
Float64Array
-
halfWidth
readonly
Float64Array
Half the extent of each node along x and y, in layout units: a marker's radius twice, or half a box node's width and height. Layouts keep nodes at least this far apart (plus their own spacing options).
nodes
readonly
number
Number of nodes; nodes are 0 … nodes − 1.
parent?
readonly
Int32Array<ArrayBufferLike>
Tree input (ids / parents, as the hierarchical traces take): each node's parent, -1 for a root. When absent, a tree layout derives the parents from the links (a spanning forest from the nodes without incoming links).
source
readonly
Int32Array
Node index of each link's source and target. Only links between two existing nodes are here (the trace drops the others), self-links (source[k] === target[k]) and parallel links included: a layout that cannot use them skips them.
target
readonly
Int32Array
-
value?
readonly
Float64Array<ArrayBufferLike>
A value per node that a layout may place by (a dendrogram's branch height). NaN: none.
weight
readonly
Float64Array
link.value of each link, 1 where it has none. Finite and positive.
x
readonly
Float64Array
Positions the figure gives (node.x, node.y, and node.z for graph3d), NaN where it gives none. A node with all of its coordinates given is pinned: a layout that moves nodes (force) leaves it there and lets it act on the others; a layout that places every node itself (layered, tree) ignores these. A node with some coordinates given is held on those and free along the others.
