|
Public Member Functions |
| | PriorityQueue (int max) |
| | Create a new priority queue.
|
| | ~PriorityQueue () |
| | Destroy the queue.
|
| void | add2Queue (node *n, const double deltaNeighbour, int numPropagate) |
| | Add 'n' to our queue, sorting by the value of deltaNeighbour TODO: slow (but conveniently modular...).
|
| bool | empty () |
| | Return true iff the queue is empty.
|
| QueueEntry * | pop () |
| | Pop the top state.
|
| bool | inQueue (const node *n) |
| | Return true iff n is queued.
|
| void | print () |
Public Attributes |
| unsigned int | _maxEntries |
Private Attributes |
| std::list< QueueEntry * > | _entries |
We also expect that these queues will be quite small (so try to win with hardware instead of algorithms).