Implements a very fast link routing algorithm that uses a tree to represent the free and occupied regions in the diagram.
The following tables list the members exposed by the QuickRouter type.
Name | Description | |
---|---|---|
![]() |
Initializes a new instance of the QuickRouter class. |
Name | Description | |
---|---|---|
![]() |
Gets the granularity of the obstacles map generated by QuickRouter. |
|
![]() |
Gets a value added to the total cost of a route if it makes a turn. |
|
![]() |
Gets the maximum U-bend length. |
|
![]() |
Implements Resume. |
|
![]() |
Routes all links in the diagram. |
|
![]() |
Implements LinkRouter.RouteLink. |
|
![]() |
Implements LinkRouter.RouteLinks. |
|
![]() |
Sets the granularity of the obstacles map generated by QuickRouter. |
|
![]() |
Sets a value added to the total cost of a route if it makes a turn. |
|
![]() |
Sets the maximum U-bend length. |
|
![]() |
Implements LinkRouter.Suspend. |