Class pv.Layout.Tree
Extends
pv.Layout.Hierarchy.
Implements a node-link tree diagram using the Reingold-Tilford "tidy"
tree layout algorithm. The specific algorithm used by this layout is based on
"Improving
Walker's Algorithm to Run in Linear Time" by C. Buchheim, M. Jünger
& S. Leipert, Graph Drawing 2002. This layout supports both cartesian and
radial orientations orientations for node-link diagrams.
The tree layout supports a "group" property, which if true causes siblings to be positioned closer together than unrelated nodes at the same depth. The layout can be configured using the depth and breadth properties, which control the increments in pixel space between nodes in both dimensions, similar to the indent layout.
For more details on how to use this layout, see
pv.Layout.Hierarchy.
Defined in: Tree.js.
Constructor Attributes | Constructor Name and Description |
---|---|
Constructs a new, empty tree layout.
|
Field Attributes | Field Name and Description |
---|---|
The offset between siblings nodes; defaults to 15.
|
|
Default properties for tree layouts.
|
|
The offset between parent and child nodes; defaults to 60.
|
|
The sibling grouping, i.e.
|
|
The orientation.
|
- Fields borrowed from class pv.Layout.Network:
- label, link, node
- Fields borrowed from class pv.Panel:
- canvas, children, overflow, transform
- Fields borrowed from class pv.Bar:
- fillStyle, height, lineWidth, strokeStyle, width
- Fields borrowed from class pv.Mark:
- bottom, childIndex, cursor, data, events, index, left, parent, proto, reverse, right, root, scale, title, top, type, visible
- Methods borrowed from class pv.Layout.Network:
- reset
- Methods borrowed from class pv.Panel:
- add, anchor
- Methods borrowed from class pv.Mark:
- anchorTarget, def, event, extend, margin, mouse, render
- left - left-to-right.
- right - right-to-left.
- top - top-to-bottom.
- bottom - bottom-to-top.
- radial - radially, with the root at the center.