Tree graph · Groups with visibility

Hiding a group removes nodes and incident links and reflows the rest.

Use a tree graph for an acyclic hierarchy with at most one parent per node. Multiple roots form a forest. Source nodes have names and optional groups, never invented numeric values.

Up to 128 nodes and 512 directed links. Node/link IDs are unique; link endpoints must exist. At most 15 declared or implicit groups; omitted groupId uses nodes. links is reserved for connector styling.

Group colours and legend visibility remove nodes plus incident links and reflow the graph. Individual detail reports visible incoming/outgoing connections and depth as computed metrics. Node names default to visible. Optional viewport uses normalized 0–1 X/Y; no axes, references, crosshair, shared tooltip or point/marker controls. An empty zoom region leaves the source intact; zoom out or reset the view to inspect its nodes. Connector styles remain valid with no visible edges or all groups hidden; the legend can restore the original nodes and colors.