Implements a simulated annealing graph layout algorithm.
The following tables list the members exposed by the AnnealLayout type.
Name | Description | |
---|---|---|
Initializes a new instance of the AnnealLayout class. |
Name | Description | |
---|---|---|
Gets or sets how to align links to the anchor points of nodes. (Inherited from Layout.) |
||
Gets or sets a value indicating whether the layout should approximate the length of graph links by calculating the distance between the centers of their incident nodes. |
||
Gets or sets a value indicating the importance of the distance between nodes and the layout area boundaries, relative to the other criteria considered by the algorithm. |
||
Gets or sets a value indicating the importance of the low number of link crossings, relative to the other criteria considered by the algorithm. |
||
Gets or sets a value indicating the importance of the node distribution, relative to the other criteria considered by the algorithm. |
||
Gets or sets a value specifying whether the layout should gather statistics while running. |
||
Gets or sets a value indicating whether the layout should increase the diagram bounds to fit the arranged content. (Inherited from Layout.) |
||
Gets or sets the initial temperature of the simulated annealing process. |
||
Gets or sets how many node shift iterations to perform at each stage of the algorithm. |
||
Gets or sets a value indicating whether to treat each group of nodes as a single vertex in the arranged graph. (Inherited from Layout.) |
||
Gets or sets the size of the layout area. |
||
Gets or sets a delegate, which is invoked when the position of a link is changed by the layout. (Inherited from Layout.) |
||
Gets or sets a delegate, which is invoked when the position of a node is changed by the layout. (Inherited from Layout.) |
||
Gets or sets a value indicating the importance of the short length of links, relative to the other criteria considered by the algorithm. |
||
Gets or sets the distance between the top-left corner of the smallest rectangle containing the arranged diagram and the top-left point of the document bounds. (Inherited from Layout.) |
||
Gets or sets a value indicating how multiple independent graphs in the diagram should be positioned relatively to each other. (Inherited from Layout.) |
||
Gets a user-friendly name of the layout. |
||
Gets or sets a value indicating the importance of low number of overlaps between links and nodes relative to the other criteria considered by the algorithm. |
||
Gets or sets a value indicating the importance of the distance between nodes and links, relative to the other criteria considered by the algorithm. |
||
Gets or sets the progress callback delegate. (Inherited from Layout.) |
||
Gets or sets a value indicating whether the nodes should be placed at random positions when the layout routine starts. |
||
Specifies the padding distance between repeating links. (Inherited from Layout.) |
||
Gets or sets a node indicating which subgraph of the diagram should be laid out. |
||
Gets or sets a value indicating whether unconnected subgraphs should be laid out independently from each other. |
||
Gets or sets how many cool-down stages the algorithm should simulate. |
||
Gets statistics about the layout execution and end results. |
||
Gets or sets how much the simulated temperature is decreased at each stage of the algorithm. |
||
Gets or sets what width/height ratio the layout area should have. |
Name | Description | |
---|---|---|
Gets the default value of the Margins property. |
Name | Description | |
---|---|---|
Overloaded. Applies the layout to a Diagram instance. (Inherited from Layout.) |
||
Initializes the layout object for a step-by-step execution. |
||
Completes the step-by-step execution started with a call to BeginArrange. |
||
Runs one or more layout iterations. |