Generated on Tue Jul 27 2010 21:59:22 for Gecode by doxygen 1.7.1

Classes

class  Gecode::Search::Statistics
 Search engine statistics More...
class  Gecode::Search::Options
 Search engine options More...
class  Gecode::DFS< T >
 Depth-first 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...
class  Gecode::LDS< T >
 Limited discrepancy search engine. More...

Namespaces

namespace  Gecode::Search::Config
 

Search configuration


Modules

 Stop-objects for stopping search

Functions

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.
template<class T >
T * Gecode::lds (T *s, const Search::Options &o=Search::Options::def)
 Invoke limited-discrepancy search for s as root node and optionso.

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> 

Function Documentation

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.

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.

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.

Additionally, s must implement a member function

 virtual 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.

template<class T >
T * Gecode::lds ( T *  s,
const Search::Options &  o 
)

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