57 return dynamic_cast<T*
>(e->next());
63 return e->statistics();
84 while (T*
n = b.
next()) {
#define GECODE_SEARCH_EXPORT
Engine * bab(Space *s, const Options &o)
Create branch and bound engine.
int n
Number of negative literals for node type.
Depth-first branch-and-bound search engine.
T * bab(T *s, const Search::Options &o)
Perform depth-first branch-and-bound search for subclass T of space s and options o...
BAB(T *s, const Search::Options &o=Search::Options::def)
Initialize engine for space s and options o.
bool stopped(void) const
Check whether engine has been stopped.
No-goods recorded from restarts.
Search::Statistics statistics(void) const
Return statistics.
NoGoods & nogoods(void)
Return no-goods.
Base-class for search engines.
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
T * next(void)
Return next better solution (NULL, if none exists or search has been stopped)