Gecode::BAB< T > Class Template Reference
[Search engines]
Depth-first branch-and-bound search engine. More...
#include <search.hh>
Public Member Functions | |
BAB (T *s, const Search::Options &o=Search::Options::def) | |
Initialize engine for space s and options o. | |
Static Public Attributes | |
static const bool | best = true |
Whether engine does best solution search. |
Detailed Description
template<class T>
class Gecode::BAB< T >
Depth-first branch-and-bound search engine.
Additionally, s must implement a member function
virtual void constrain(const T& t)
Whenever exploration requires to add a constraint to the space c currently being explored, the engine executes c.constrain(t)
where t is the so-far best solution.
Definition at line 1070 of file search.hh.
Constructor & Destructor Documentation
template<class T >
Gecode::BAB< T >::BAB | ( | T * | s, | |
const Search::Options & | o = Search::Options::def | |||
) | [inline] |
Member Data Documentation
template<class T>
const bool Gecode::BAB< T >::best = true [static] |
The documentation for this class was generated from the following files: