34 #ifndef __GECODE_SEARCH_SEQ_LDS_HH__ 35 #define __GECODE_SEARCH_SEQ_LDS_HH__ 41 namespace Gecode {
namespace Search {
namespace Seq {
44 template<
class Tracer>
48 typedef typename Tracer::ID
ID;
70 unsigned int alt(
void)
const;
72 unsigned int nid(
void)
const;
100 bool done(
void)
const;
104 template<
class Tracer>
125 void constrain(
const Space&
b);
129 virtual bool stopped(
void)
const;
Space * root
Root node for problem.
bool exhausted
Whether entire search space has been exhausted.
Search engine implementation interface
Space * cur
Current space.
unsigned int nid(void) const
Return node identifier.
Space * space(void) const
Return space.
Tracer::ID ID
Node identity type.
Node(void)
Default constructor.
unsigned int d
Current discrepancy.
bool stopped(void) const
Check whether engine has been stopped.
void next(void)
Set next alternative
Probe(const Options &opt)
Initialize.
Gecode::FloatVal c(-8, 8)
unsigned int alt(void) const
Return next alternative.
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Statistics statistics(void) const
Return statistics.
Support::DynamicStack< Node, Heap > ds
Stack storing current path in search tree
const Choice * choice(void) const
Return choice.
bool no_solution
Solution found for current discrepancy.
Choice for performing commit
bool done(void) const
Test whether probing is done.
Stack with arbitrary number of elements.
Tracer tracer
Search tracer.
Probe< Tracer > e
The probe engine.
void init(Space *s)
Initialize with space s.
unsigned int d
Current discrepancy.
Gecode toplevel namespace
Options opt
Search options.
Node in the search tree for LDS
Limited discrepancy search engine implementation.
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.