Gecode::Search::Options Class Reference

#include <search.hh>

Detailed Description

Search engine options

Defines options for search engines. Not all search engines might honor all option values.

c_d as minimal recomputation distance: this guarantees that a path between two nodes in the search tree for which copies are stored has at least length c_d. That is, in order to recompute a node in the search tree, c_d recomputation steps are needed. The minimal recomputation distance yields a guarantee on saving memory compared to full copying: it stores c_d times less nodes than full copying.
a_d as adaptive recomputation distance: when a node needs to be recomputed and the path is longer than a_d, an intermediate copy is created (approximately in the middle of the path) to speed up future recomputation. Note that small values of a_d can increase the memory consumption considerably.

Full copying corresponds to a maximal recomputation distance c_d of 1.

All recomputation performed is based on batch recomputation: batch recomputation performs propagation only once for an entire path used in recomputation.

Definition at line 224 of file search.hh.


Public Member Functions
	Options (void)
	Initialize with default values.
Public Attributes
unsigned int	c_d
	Create a clone after every c_d commits.
unsigned int	a_d
	Create a clone during recomputation if distance is greater than a_d.
Stop *	stop
	Stop object for stopping search.
Static Public Attributes
static const Options	def
	Default options.