Gecode::Restart< T > Class Template Reference
[Search engines]

#include <search.hh>

Inherits Gecode::DFS< T >.

List of all members.

---

Detailed Description

template<class T>
class Gecode::Restart< T >

Depth-first restart best solution search engine.

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 714 of file search.hh.

Public Member Functions
	Restart (T *s, const Search::Options &o=Search::Options::def)
	Initialize engine for space s and options o.
	~Restart (void)
	Destructor.
T *	next (void)
	Return next better solution (NULL, if none exists or search has been stopped).
Protected Attributes
Space *	root
	Root node.
Space *	best
	So-far best solution.

---

Constructor & Destructor Documentation

template<class T>

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

Initialize engine for space s and options o.

Definition at line 46 of file restart.icc.

template<class T>

Gecode::Restart< T >::~Restart

(

void

)

[inline]

Destructor.

Definition at line 55 of file restart.icc.

---

Member Function Documentation

template<class T>

T * Gecode::Restart< T >::next

(

void

)

[inline]

Return next better solution (NULL, if none exists or search has been stopped).

Reimplemented from Gecode::DFS< T >.

Definition at line 62 of file restart.icc.

---

Member Data Documentation

template<class T>

Space* Gecode::Restart< T >::root [protected]

Root node.

Definition at line 717 of file search.hh.

template<class T>

Space* Gecode::Restart< T >::best [protected]

So-far best solution.

Definition at line 719 of file search.hh.

---

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

• gecode/search.hh (Revision: 7310)
• gecode/search/restart.icc (Revision: 6273)