42 namespace Gecode {
namespace Search {
66 return build<T,BAB>(s,
opt);
76 : Search::Base<T>(Search::
bab(s,o)) {}
83 while (T*
n = b.
next()) {
Search engine implementation interface
#define GECODE_SEARCH_EXPORT
A class for building search engines.
Options opt
Stored and already expanded options.
Engine * bab(Space *s, const Options &o)
Create branch and bound engine.
virtual T * next(void)
Return next solution (NULL, if none exists or search has been stopped)
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.
BabBuilder(const Options &opt)
The constructor.
bool best(void) const
Whether engine is a best solution search engine.
virtual Engine * operator()(Space *s) const
The actual build function.
Gecode toplevel namespace
struct Gecode::@554::NNF::@60::@61 b
For binary nodes (and, or, eqv)