Implements orthogonal graph layout algorithm.Each link is drawn as a chain of alternating horizontal and vertical segments.Nodes are placed in a way that facilitates few links bends and crossings.
The following tables list the members exposed by the OrthogonalLayout type.
Name | Description | |
---|---|---|
Initializes a new instance of the OrthogonalLayout class. |
Name | Description | |
---|---|---|
Gets or sets how to align links to the anchor points of nodes. (Inherited from Layout.) |
||
Gets or sets whether to treat each group of attached nodes as a single vertex in the arranged graph. (Inherited from Layout.) |
||
Gets or sets the margins' size around individual subgraphs processed by this layout object. (Inherited from Layout.) |
||
Gets or sets a value indicating the minimum size of a lane. |
||
Gets or sets how multiple independent graphs in the diagram should be positioned relatively to each other. (Inherited from Layout.) |
||
Gets or sets a value indicating how much space to leave between nodes in adjacent lanes. |
||
Gets or sets a value indicating whether to refine the layout. |
Name | Description | |
---|---|---|
Applies the layout to the specified graph. |