Performs hierarchical layout on simple, connected, level-planar graphs. The hierarchical layout places vertices on predefined levels, such that if the source graph is level-planar it is guaranteed that all edges will have a single segment and will not intersect. A planar graph is considered level-planar if it is still possible to draw it without edge intersections when its vertices are positioned on predefined levels.

The following tables list the members exposed by the HierarchicalLayout type.

 Public Constructors

	Name	Description
	HierarchicalLayout	Initializes a new instance of the HierarchicalLayout class.

 Public Methods

	Name	Description
	arrange	Applies the layout to the specified graph using the specified settings.

 See Also