Meziantou.FrameworkTreeLayout Class
Lays a tree out as a tidy node-link diagram, as d3's tree: the Reingold–Tilford algorithm in the linear-time version of Buchheim, Jünger and Leipert (2002). The nodes of a depth are on a line, a parent is centered over its children, and subtrees are as compact as possible without overlapping. Siblings are 1 unit apart, cousins 2.
public sealed class TreeLayoutConstructors
| Name | Description |
|---|---|
| TreeLayout() |
TreeLayout()
TreeLayout.cspublic TreeLayout()No documentation is available.
Properties
| Name | Description |
|---|---|
| Height | Gets or sets the size of the layout along the depths. The default is 1. |
| Width | Gets or sets the size of the layout across the depths. The default is 1. |
Height
TreeLayout.csWidth
TreeLayout.csMethods
| Name | Description |
|---|---|
| Layout<T>(HierarchyNode<T>) | Places the nodes of a tree. |
Layout<T>(HierarchyNode<T>)
TreeLayout.csPlaces the nodes of a tree.
public IReadOnlyList<HierarchyPoint<T>> Layout<T>(HierarchyNode<T> root)Type parameters
T- The type of the data of the nodes.
Parameters
rootHierarchyNode<T>- The root of the tree.
Returns
IReadOnlyList<HierarchyPoint<T>> The point of every node, in pre-order.