Interface | Description |
---|---|
Poolable<T> |
Objects of a class that implements this interface can be held in an object pool
|
Class | Description |
---|---|
AStarBlockageWorker |
Sets the X marks on the map for the given blockage.
|
AStarMaster |
Creates the jobs for the worker threads and processes the results
|
AStarRoutingFrame |
Integrates the routing algorithm into the Electric framework
|
AStarWorker |
Does the actual A* routing for the given net
|
BenchmarkRouter |
this class serves testing and configuration only,
can be discarded if parameters are moved to AStarRoutingFrame
|
CellPrinter | |
EndPoint |
Helper class for EndPointMarker which wraps a start/finish end point
|
EndPointMarker |
Determines the possible start/finish layers for the paths in the nets
and adds corresponding markings to the map
|
Goal |
Gives the A* movement information to AStarWorker to direct the routing
|
Map |
Contains the status of the grid points
|
Net |
Contains all segments belonging to the same netID
|
Node |
The classic A* node
|
ObjectPool<T extends Poolable<T>> |
Implements object pooling by collecting unneeded objects and
handing them out later
|
Path |
Contains information to route the contained segment and later contains the routing points
|
PriorityQueue |
This class implements a priority queue by using a splay tree and forming a
doubly linked list for entries with the same key
this list is ordered (numbers represent add order:
(0, n-1, n-2, ..., 1)
remove order will happen reverse to addition,
i.e.
|
QuadTree |
Recursively sub-divides the grid into squares until reaching the cutOffSize
to allow for querying the size of the free square around a position
|
SplayTree |
Implements a top-down splay tree.
|
Storage |
Contains the open and closed lists for the A* algorithm and allows for
getting the node corresponding to a position, if any
|