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