Gecode::Search::Queue Class Reference
Priority queue of open nodes for A*. More...
#include <gecode/search/heuristic.hh>
Public Member Functions | |
| Queue (const Priority &p0) | |
| Initialize with priority p. | |
| bool | empty (void) const |
| Whether the queue is empty. | |
| void | push (const Entry &e) |
| Add entry e. | |
| Entry | pop (void) |
| Remove and return the preferred entry. | |
| void | clear (void) |
| Delete all entries. | |
Protected Attributes | |
| Entries | entries |
| The entries as a binary heap with the preferred entry first. | |
| Priority | p |
| The priority. | |
Detailed Description
Priority queue of open nodes for A*.
Definition at line 135 of file heuristic.hh.
Constructor & Destructor Documentation
◆ Queue()
|
inline |
Initialize with priority p.
Definition at line 143 of file heuristic.hh.
Member Function Documentation
◆ empty()
|
inline |
Whether the queue is empty.
Definition at line 145 of file heuristic.hh.
◆ push()
|
inline |
Add entry e.
Definition at line 147 of file heuristic.hh.
◆ pop()
|
inline |
Remove and return the preferred entry.
Definition at line 154 of file heuristic.hh.
◆ clear()
|
inline |
Delete all entries.
Definition at line 161 of file heuristic.hh.
Member Data Documentation
◆ entries
|
protected |
The entries as a binary heap with the preferred entry first.
Definition at line 138 of file heuristic.hh.
◆ p
|
protected |
The priority.
Definition at line 140 of file heuristic.hh.
The documentation for this class was generated from the following file:
- gecode/search/heuristic.hh
