Depth-first branch-and-bound search engine. More...
#include <search.hh>
Public Member Functions | |
BAB (T *s, const Search::Options &o=Search::Options::def) | |
Initialize engine for space s and options o. | |
T * | next (void) |
Return next better solution (NULL, if none exists or search has been stopped) | |
Search::Statistics | statistics (void) const |
Return statistics. | |
bool | stopped (void) const |
Check whether engine has been stopped. | |
~BAB (void) | |
Destructor. |
Depth-first branch-and-bound search engine.
Additionally, s must implement a member function
virtual void constrain(const T& t)
Whenever exploration requires to add a constraint to the space c currently being explored, the engine executes c.constrain(t)
where t is the so-far best solution.
Gecode::BAB::BAB | ( | T * | s, |
const Search::Options & | o = Search::Options::def |
||
) | [inline] |
T * Gecode::BAB::next | ( | void | ) | [inline] |
Search::Statistics Gecode::BAB::statistics | ( | void | ) | const [inline] |
bool Gecode::BAB::stopped | ( | void | ) | const [inline] |