Gecode::Search::BabEngine Class Reference

#include <search.hh>

Detailed Description

Implementation of depth-first branch-and-bound search engines.

Definition at line 582 of file search.hh.


Public Types
enum	ExploreStatus { ES_SOLUTION, ES_CONSTRAIN }
	Status of the explore function. More...
Public Member Functions
	BabEngine (unsigned int c_d, unsigned int a_d, Stop *st, size_t sz)
	Initialize engine.
void	init (Space *s)
	Initialize engine to start at space s.
ExploreStatus	explore (Space &s1, Space &s2)
	Search for next better solution
size_t	stacksize (void) const
	Return stack size used by engine.
	~BabEngine (void)
	Destructor.

Status of the explore function.

Enumerator:

ES_SOLUTION
ES_CONSTRAIN

Definition at line 585 of file search.hh.

Gecode::Search::BabEngine::BabEngine	(	unsigned int	c_d,
		unsigned int	a_d,
		Stop *	st,
		size_t	sz
	)			`[inline]`

Initialize engine.

Parameters:

	c_d	minimal recomputation distance
	a_d	adaptive recomputation distance
	st	Stop-object
	sz	size of one space

Definition at line 52 of file bab.icc.

Gecode::Search::BabEngine::~BabEngine ( void ) [inline]

Destructor.

Definition at line 70 of file bab.icc.

void Gecode::Search::BabEngine::init ( Space * s ) [inline]

Initialize engine to start at space s.

Definition at line 60 of file bab.icc.

BabEngine::ExploreStatus Gecode::Search::BabEngine::explore	(	Space *&	s1,
		Space *&	s2
	)

Search for next better solution

If ES_SOLUTION is returned, a next better solution has been found. This solution is available from s1.

If ES_CONSTRAIN is returned, the engine requires that the space s1 is constrained to be better by the so-far best solution s2.

Definition at line 54 of file bab.cc.

size_t Gecode::Search::BabEngine::stacksize ( void ) const [inline]

Return stack size used by engine.

Definition at line 65 of file bab.icc.

The documentation for this class was generated from the following files: