The FractalLayout tree layout algorithm places child nodes symmetrically around their parent node. Nodes at the lowest level are arranged directly in a circle around their parent. At the upper level, the already arranged nodes form branches that are arranged in a circle around the new parent node. The algorithm is recursively repeated till the highest level is reached.
The following tables list the members exposed by the FractalLayout type.
Public Constructors| Name | Description | |
|---|---|---|
 |
Initializes a new instance of the FractalLayout class. |
Public Properties| Name | Description | |
|---|---|---|
 |
Gets or sets a value indicating how to align links to the anchor points of nodes. |
|
|
Gets or sets a value indicating whether to treat each group of nodes as a single vertex in the arranged graph. |
|
|
Gets or sets the margins' size around individual subgraphs processed by this layout object. (Inherited from Layout.) |
|
|
Gets or sets a value indicating how multiple independent graphs in the diagram should be positioned relatively to each other. |
|
|
Gets or sets the node that should be placed at the center of the tree. |
See Also
