Interface: GraphModel

Experimental

Properties

Property	Modifier	Type	Description
box	readonly	boolean	Experimental Nodes are boxes around their labels (node.shape: 'box').
degree	readonly	Int32Array	Experimental Link ends at each node: indegree counts the links that end at it, outdegree those that start at it, and degree is their sum (so a self-link counts twice, as in graph theory).
dropped	readonly	number	Experimental Links left out because an end is not a node (or closes a cycle of parents).
fan	readonly	Float32Array	Experimental Curvature that fans out the links between the same two nodes; 0 for a single link.
given	readonly	number	Experimental How many of the nodes the trace gives (the others are implied parents).
group	readonly	Int32Array	Experimental Group index of each node (node.group), -1 for none, and the groups' names by index.
groupNames	readonly	readonly string[]	Experimental
halfHeight	readonly	Float64Array	Experimental
halfWidth	readonly	Float64Array	Experimental Half the extent of each node in px: the radius twice, or half a box's width and height.
implied	readonly	readonly string[]	Experimental
indegree	readonly	Int32Array	Experimental
labels	readonly	ArrayLike<unknown> | undefined	Experimental Where labels come from: node.label, else labels; and the labels of implied parents.
linkIndex	readonly	Int32Array	Experimental Index of each kept link in the trace's link arrays (tree input: the child's row).
links	readonly	number	Experimental Number of links kept.
loop	readonly	Int32Array	Experimental For a self-link, its number among its node's self-links (0, 1, …); -1 for other links.
nodes	readonly	number	Experimental Number of nodes: the rows the trace gives, then the parents tree input implied.
nodeValue	readonly	Float64Array<ArrayBufferLike> | undefined	Experimental node.value as numbers, NaN where a node has none; unset when the trace gives no finite value at all. What a dendrogram's heights, tree.sort: 'value' and hive.position: 'value' read.
outdegree	readonly	Int32Array	Experimental
parent	readonly	Int32Array<ArrayBufferLike> | undefined	Experimental Tree input: each node's parent, -1 for a root. Unset for node / link input.
size	readonly	Float32Array	Experimental Drawn diameter of each node in px (a box node: its larger side).
source	readonly	Int32Array	Experimental Node index of each kept link's ends.
target	readonly	Int32Array	Experimental
value	readonly	Float64Array	Experimental link.value as given; NaN where a link has none.
weight	readonly	Float64Array	Experimental link.value where it is a positive number, else 1: the weight layouts use.