Implements algorithms for arranging tree structures.
The following tables list the members exposed by the TreeLayout type.
Name | Description | |
---|---|---|
Initializes a new instance of the TreeLayout class. |
Name | Description | |
---|---|---|
Indicates how to align links to the anchor points of nodes. |
||
A Boolean value indicating whether the "assistant" nodes on the same side of a single parent are arranged as close to each other as possible. Turning this off will force the nodes on one side to be aligned with their counterparts in the other and occasionally leaving space between adjacent branches. |
||
The orientation of the arranged graph. |
||
A Boolean value indicating whether the "assistant" trait is regarded when applying the layout. |
||
Indicates whether to treat each Group of nodes as a single vertex in the arranged graph. |
||
Indicates whether to keep the root node at its original position. |
||
The space to leave between adjacent levels of the tree. |
||
The type of the links in the arranged tree. |
||
Indicates how multiple independent graphs in the diagram should be positioned relatively to each other. |
||
The space to leave between adjacent nodes on the same level. |
Name | Description | |
---|---|---|
Applies the layout to the specified graph. |