|
Algorithm Development Kit 1.0 |
||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
null when all is done.
TreeMap which is itself an implementation of the
algorithm as described in Cormen, Leiserson, and Rivest's
Introduction to Algorithms (Cormen et al, 2001).DoubleLinkedList.IHypercube.intersects(IMultiPoint).
IInterval objects for this node as a collection.
Comparable objects.
IGameState position with a MoveEvaluation
that produced the game state.DoubleLinkedListIterator.next() iterator method.
StateTree.comp as the comparator.
|
Algorithm Development Kit 1.0 | ||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||