Gecode::AStar< T > Class Template Reference
A* search engine (experimental). More...
#include <gecode/search.hh>
Public Member Functions | |
| AStar (T *s, const Search::Options &o=Search::Options::def) | |
| Initialize engine for space s and options o. | |
| Public Member Functions inherited from Gecode::Search::Base< T > | |
| virtual T * | next (void) |
| Return next solution (nullptr, if none exists or search has been stopped). | |
| virtual Statistics | statistics (void) const |
| Return statistics. | |
| virtual bool | stopped (void) const |
| Check whether engine has been stopped. | |
| virtual | ~Base (void) |
| Destructor. | |
Static Public Attributes | |
| static const bool | best = true |
| Whether engine does best solution search. | |
Additional Inherited Members | |
| Static Public Member Functions inherited from Gecode::HeapAllocated | |
| static void * | operator new (size_t s) |
| Memory management. | |
| static void | operator delete (void *p) |
| Free memory allocated from heap. | |
| Protected Member Functions inherited from Gecode::Search::Base< T > | |
| Base (Engine *e=nullptr) | |
| Constructor. | |
| Protected Attributes inherited from Gecode::Search::Base< T > | |
| Engine * | e |
| The actual search engine. | |
Detailed Description
template<class T>
class Gecode::AStar< T >
class Gecode::AStar< T >
A* search engine (experimental).
Expands nodes in order of their bound, then their rank, using the guidance from Search::Options::guidance. Like BAB, next() returns improving solutions and exhausting the search proves the last solution optimal.
All open nodes are stored as clones, so c_d and a_d are ignored. Tracing is not supported.
Constructor & Destructor Documentation
◆ AStar()
template<class T>
|
inline |
Member Data Documentation
◆ best
template<class T>
|
static |
The documentation for this class was generated from the following files:
