Implements a link routing algorithm that uses a grid to represent the free and occupied regions in the diagram.
The following tables list the members exposed by the GridRouter type.
Name | Description | |
---|---|---|
Initializes a new instance of the GridRouter class. |
Name | Description | |
---|---|---|
Gets a value added to the total cost of a route which causes a link to cross another link. |
||
Gets the size of the pieces of the routing grid. |
||
Gets a value added to the total cost of a route for each piece of the routing grid occupied by the route. |
||
Gets a value added to the total cost of a route if the route passes too close to a node. |
||
Gets the size of a buffer zone around a node for which routes get a penalty cost if they pass through it. |
||
Gets a value added to the total cost of a route if the route passes too close to a node. |
||
Sets a value added to the total cost of a route which causes a link to cross another link. |
||
Sets the size of the pieces of the routing grid. |
||
Sets a value added to the total cost of a route for each piece of the routing grid occupied by the route. |
||
Sets a value added to the total cost of a route if the route passes too close to a node. |
||
Sets the size of a buffer zone around a node for which routes get a penalty cost if they pass through it. |
||
Sets a value added to the total cost of a route if the route passes too close to a node. |