Name | Description | |
---|---|---|
![]() |
Gets a value indicating whether the routing algorithm should align links to the anchor points of nodes. |
|
![]() |
Gets whether link segments should be pulled apart when they overlap in initially found routes. |
|
![]() |
Gets the value added to the total route cost if a link crosses another link. |
|
![]() ![]() |
Return a heuristic function that returns the real distance sqrt(dx^2 + dy^2) between two pieces of the routing grid. |
|
![]() ![]() |
Returns a heuristic function that returns the square distance dx^2 + dy^2 as a cost evaluation of the distance between two pieces of the routing grid. |
|
![]() |
Gets a value indicating whether the algorithm should spend time to optimize long routes. |
|
![]() |
Gets a value indicating whether routes should end in horizontal or vertical direction. |
|
![]() |
Gets the size of the routing grid. |
|
![]() |
For internal use. |
|
![]() |
Gets the value added to the total route cost for each grid square occupied by the link. |
|
![]() ![]() |
Returns a heuristic function that returns max(dx, dy) as a cost evaluation of the distance between two pieces of the routing grid. |
|
![]() |
Gets the value added to the total route cost when a link passes through the buffer area around a node. |
|
![]() |
Gets the size of the buffer area around a node for which link routes are assigned higher costs if they pass through that area. |
|
![]() |
Gets a value indicating whether the end segments of Polyline links should be oriented orthogonally to node's borders and each other. |
|
![]() |
Gets the heuristic function used by the routing algorithm to choose next points in the route. |
|
![]() |
Gets a value indicating whether routes should start in horizontal or vertical direction. |
|
![]() |
Gets a value indicating when JDiagram should look for new link routes. |
|
![]() |
Gets the value added to the total route cost when a link makes a turn. |
|
![]() |
Sets a value indicating whether the routing algorithm should align links to the anchor points of nodes. |
|
![]() |
Sets whether link segments should be pulled apart when they overlap in initially found routes. |
|
![]() |
Sets the value added to the total route cost if a link crosses another link. |
|
![]() |
Sets the routing cost parameters to their default values. |
|
![]() |
Sets a value indicating whether the algorithm should spend time to optimize long routes. |
|
![]() |
Sets a value indicating whether routes should end in horizontal or vertical direction. |
|
![]() |
Sets the size of the routing grid. |
|
![]() |
Sets the value added to the total route cost for each grid square occupied by the link. |
|
![]() |
Sets the routing costs to values that find routes having low number of segments. |
|
![]() |
Sets the value added to the total route cost when a link passes through the buffer area around a node. |
|
![]() |
Sets the size of the buffer area around a node for which link routes are assigned higher costs if they pass through that area. |
|
![]() |
Sets a value indicating whether the end segments of Polyline links should should be oriented orthogonally to node's borders and each other. |
|
![]() |
Sets the routing costs to values that quickly find routes, however with a lower route quality. |
|
![]() |
Sets the heuristic function used by the routing algorithm to choose next points in the route. |
|
![]() |
Sets a value indicating whether routes should start in horizontal or vertical direction. |
|
![]() |
Sets a value indicating when JDiagram should look for new link routes. |
|
![]() |
Sets the value added to the total route cost when a link makes a turn. |