Skip to content

Interface: RadialTreeResult ​

What radialTreeLayout returns.

Extends ​

Properties ​

PropertyModifierTypeDescriptionInherited from
anglereadonlyFloat64ArrayPolar position of each node about the origin: angle in degrees counter-clockwise from +x, radius in layout units (0 for a root in the centre). For labels turned along the radius.-
clusters?readonlyreadonly LayoutCluster[]-TreeLayoutResult.clusters
depthreadonlyInt32ArrayLinks from the root, 0 for a root.TreeLayoutResult.depth
hiddenreadonlyUint8Array1 where the node is below a collapsed node; it sits on its nearest visible ancestor.TreeLayoutResult.hidden
parentreadonlyInt32ArrayThe forest that was drawn: each node's parent, -1 for a root.TreeLayoutResult.parent
parentLinkreadonlyInt32ArrayThe link that joins each node to its parent, -1 where there is none.TreeLayoutResult.parentLink
parentRoutes?readonlyreadonly (LinkRoute | undefined)[]The same routes by child node: the path from a node's parent to it (undefined: straight, hidden or a root). For a figure that gives a tree as ids / parents and has no links to hang LayoutResult.routes on. Absent when all links are straight.TreeLayoutResult.parentRoutes
radiusreadonlyFloat64Array--
reversed?readonlyUint8Array<ArrayBufferLike>Links the layout reversed to break cycles (layered): drawn in the back-edge style.TreeLayoutResult.reversed
routes?readonlyreadonly (LinkRoute | undefined)[]Routes of the links that are not straight, by link index (sparse: undefined or a missing entry is a straight link). Indices are those of LayoutGraph.source.TreeLayoutResult.routes
treeLinksreadonlyUint8ArrayBy link index: 1 where the link is a tree edge. The others (links that close a cycle, skip a level or repeat a tree edge) are not part of the layout and never have a route.TreeLayoutResult.treeLinks
xreadonlyFloat64ArrayNode centers, one per node. Always finite.TreeLayoutResult.x
yreadonlyFloat64Array-TreeLayoutResult.y
z?readonlyFloat64Array<ArrayBufferLike>Only from a 3D layout.TreeLayoutResult.z

Released under the MIT License.