34 #ifndef __GECODE_SEARCH_SEQ_DFS_HH__ 35 #define __GECODE_SEARCH_SEQ_DFS_HH__ 42 namespace Gecode {
namespace Search {
namespace Seq {
45 template<
class Tracer>
DFS(Space *s, const Options &o)
Initialize for space s with options o.
NoGoods & nogoods(void)
Return no-goods.
void constrain(const Space &b)
Constrain future solutions to be better than b (should never be called)
struct Gecode::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Depth-first path (stack of edges) supporting recomputation.
No-goods recorded from restarts.
Depth-first search engine implementation.
Space * next(void)
Search for next solution
Statistics statistics(void) const
Return statistics.
Gecode toplevel namespace