38 #ifndef __GECODE_SEARCH_SEQ_BAB_HH__ 39 #define __GECODE_SEARCH_SEQ_BAB_HH__ 46 namespace Gecode {
namespace Search {
namespace Seq {
49 template<
class Tracer>
BAB(Space *s, const Options &o)
Initialize with space s and search options o.
void constrain(const Space &b)
Constrain future solutions to be better than b.
NoGoods & nogoods(void)
Return no-goods.
Depth-first path (stack of edges) supporting recomputation.
struct Gecode::@585::NNF::@62::@63 b
For binary nodes (and, or, eqv)
No-goods recorded from restarts.
Statistics statistics(void) const
Return statistics.
Space * next(void)
Search for next better solution
Implementation of depth-first branch-and-bound search engine.
Gecode toplevel namespace