The following tables list the members exposed by the AnnealLayoutInfo type.
Name | Description | |
---|---|---|
|
Name | Description | |
---|---|---|
Gets a value indicating how important the distance from nodes to the layout area boundaries is relatively to the other criteria considered by the algorithm. |
||
Gets a value specifying how important the low number of link crossings is relatively to the other criteria considered by the algorithm. |
||
Gets a value indicating the importance of node distribution relatively to the other criteria considered by the algorithm. |
||
Gets a value specifying how important the short length of links is relatively to the other criteria considered by the algorithm. |
||
Gets how many node shift iterations to perform at each stage of the algorithm. |
||
Gets the size of the layout area. |
||
Gets a value specifying how important the low number of crossings of links with edges is relatively to the other criteria considered by the algorithm. |
||
Gets a value specifying the importance of the distance between nodes and links relative to the other criteria considered by the algorithm. |
||
Gets the cost calculations precision. |
||
Gets a value indicating whether the nodes should be placed at random positions when the layout routine starts. |
||
Gets how many cooling stages the algorithm should simulate. |
||
Gets the initial temperature of the simulated annealing process. |
||
Gets how much the simulated temperature is decreased at each stage of the algorithm. |
||
Gets what width / height ratio the layout area should have. |
||
Sets a value indicating how important the distance from nodes to the layout area boundaries is relatively to the other criteria considered by the algorithm. |
||
Sets a value specifying how important the low number of link crossings is relatively to the other criteria considered by the algorithm. |
||
Sets a value indicating the importance of node distribution relatively to the other criteria considered by the algorithm. |
||
Sets a value specifying how important the short length of links is relatively to the other criteria considered by the algorithm. |
||
Sets how many node shift iterations to perform at each stage of the algorithm. |
||
Sets the size of the layout area. |
||
Sets a value specifying how important the low number of crossings of links with edges is relatively to the other criteria considered by the algorithm. |
||
Sets a value specifying the importance of the distance between nodes and links relative to the other criteria considered by the algorithm. |
||
Sets the cost calculations precision. 1 speicifes highest precision. Accepted values are between 0.9 and 1. The algorithm completes faster when running with a lower precision, but produces slightly worse results. |
||
Sets a value indicating whether the nodes should be placed at random positions when the layout routine starts. |
||
Sets how many cooling stages the algorithm should simulate. |
||
Sets the initial temperature of the simulated annealing process. |
||
Sets how much the simulated temperature is decreased at each stage of the algorithm. |
||
Sets what width / height ratio the layout area should have. |