Gecode::BAB< T > Class Template Reference
[Search engines]
#include <search.hh>
Inherits Gecode::Search::BAB.
Detailed Description
template<class T>
class Gecode::BAB< T >
Depth-first branch-and-bound search engine.
Definition at line 631 of file search.hh.
Public Member Functions | |
BAB (T *s, unsigned int c_d=Search::Config::c_d, unsigned int a_d=Search::Config::a_d, Search::Stop *st=NULL) | |
Initialize engine. | |
T * | next (void) |
Return next better solution (NULL, if none exists or search has been stopped). |
Constructor & Destructor Documentation
template<class T>
Gecode::BAB< T >::BAB | ( | T * | s, | |
unsigned int | c_d = Search::Config::c_d , |
|||
unsigned int | a_d = Search::Config::a_d , |
|||
Search::Stop * | st = NULL | |||
) | [inline] |
Initialize engine.
- Parameters:
-
s Root node (subclass T of Space). Additionally, s must implement a member function Whenever exploration requires to add a constraint to the space c currently being explored, the engine executesvoid constrain(T* t)
c->constrain(t)
where t is the so-far best solution.c_d Minimal recomputation distance a_d Adaptive recomputation distance st Stop-object
Member Function Documentation
template<class T>
T * Gecode::BAB< T >::next | ( | void | ) | [inline] |
The documentation for this class was generated from the following files:
- gecode/search.hh (Revision: 3516)
- gecode/search/bab.icc (Revision: 3511)