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
	FractalLayout	Initializes a new instance of the FractalLayout class.

 Public Fields

	Name	Description
	anchoring	Indicates how to align links to the anchor points of nodes.
	keepGroupLayout	Indicates whether to treat each Group of nodes as a single vertex in the arranged graph.
	multipleGraphsPlacement	Indicates how multiple independent graphs in the diagram should be positioned relatively to each other.
	root	Specifies the node that should be placed at the center of the tree.

 See Also