80 while (T* n = b.next()) {
Depth-first branch-and-bound search engine.
BAB(T *s, const Search::Options &o=Search::Options::def)
Initialize engine for space s and options o.
virtual Engine * operator()(Space *s) const
The actual build function.
BabBuilder(const Options &opt)
The constructor.
Base(Engine *e=NULL)
Constructor.
Options opt
Stored and already expanded options.
Builder(const Options &opt, bool best)
Initialize with options opt and best solution search support.
bool best(void) const
Whether engine is a best solution search engine.
Search engine implementation interface
T * bab(T *s, const Search::Options &o=Search::Options::def)
Perform depth-first branch-and-bound search for subclass T of space s and options o.
Engine * babengine(Space *s, const Options &o)
Create branch and bound engine.
Engine * build(Space *s, const Options &opt)
Build an engine of type E for a script T.
Gecode toplevel namespace
Search::Builder * SEB
Type for a search engine builder.
#define GECODE_SEARCH_EXPORT