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.
|
Name | Description | |
---|---|---|
![]() |
Initializes a new instance of the FractalLayout class. |
Name | Description | |
---|---|---|
![]() |
Indicates how to align links to the anchor points of nodes. |
|
![]() |
Indicates whether to treat each Group of nodes as a single vertex in the arranged graph. |