Search engines
[Programming models]

---

Detailed Description

Defines search engines. All search engines (but Gecode::LDS, where it is not needed) support recomputation. The behaviour of recomputation is controlled by a passing a search option object (see the class Gecode::Search::Options).

Requires

 #include "gecode/search.hh" 

Namespaces
namespace	Gecode::Search::Config
	Search configuration
Modules
	Stop-objects for stopping search
Classes
class	Gecode::Search::Statistics
	Search engine statistics More...
class	Gecode::DFS< T >
	Depth-first search engine. More...
class	Gecode::LDS< T >
	Limited discrepancy search engine. More...
class	Gecode::BAB< T >
	Depth-first branch-and-bound search engine. More...
class	Gecode::Restart< T >
	Depth-first restart best solution search engine. More...
Functions
template<class T>
T *	Gecode::lds (T *s, unsigned int d, const Search::Options &o=Search::Options::def)
	Invoke limited-discrepancy search for s as root node and maximal discrepancy d.
template<class T>
T *	Gecode::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.
template<class T>
T *	Gecode::restart (T *s, const Search::Options &o=Search::Options::def)
	Perform depth-first restart best solution search for subclass T of space s and options o.

---

Function Documentation

template<class T>

T * Gecode::lds	(	T *	s,
		unsigned int	d,
		const Search::Options &	o
	)			[inline]

Invoke limited-discrepancy search for s as root node and maximal discrepancy d.

Definition at line 66 of file lds.icc.

template<class T>

T * Gecode::bab	(	T *	s,
		const Search::Options &	o = Search::Options::def
	)			[inline]

Perform depth-first branch-and-bound search for subclass T of space s and options o.

Additionally, s must implement a member function

 void constrain(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 106 of file bab.icc.

template<class T>

T * Gecode::restart	(	T *	s,
		const Search::Options &	o = Search::Options::def
	)			[inline]

Perform depth-first restart best solution search for subclass T of space s and options o.

Additionally, s must implement a member function

 void constrain(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 88 of file restart.icc.