Name | Description | |
---|---|---|
Gets or sets a value indicating whether and how arrows should be aligned to nodes' anchor points. |
||
Gets or sets a value indicating the relative distance between adjacent links in the layout. |
||
Gets or sets the node that should be placed in the last layer of the arranged graph. |
||
Gets or sets a value indicating whether to attempt to force all links to go in the same direction. If the graph being arrange has cycles, some of the links will still go backward. |
||
Gets or sets a value indicating whether the distance between adjacent nodes in the final layout should be independent of the nodes' size. |
||
Gets or sets the desired distance between layers in the resulting 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 desired distance between adjacent nodes that belong to the same layer. |
||
Gets or sets the overall orientation of the arranged diagram. |
||
Gets or sets which sub-graph of the diagram should be laid out. |
||
Gets or sets a value indicating whether to split layers that are much wider than the other layers. |
||
Gets or sets the node that should be placed in the first layer of the arranged graph. |
||
Gets or sets whether the layout algorithm should strive to straighten links that cross more than one layer of the graph. |
||
Gets or sets how many times to perform pair-swapping iterations for each layer. |
||
Gets or sets the maximum time to spend in the path searching phase, expressed in milliseconds. |
||
Specifies the horizontal margin between separate subgraphs arranged by this algorithm. |
||
Specifies the vertical margin between separate subgraphs arranged by this algorithm. |