Depth-first restart best solution search engine implementation. More...
#include <restart.hh>
Public Member Functions | |
Restart (Space *s, size_t sz, const Search::Options &o) | |
Initialize engine for space s (with size sz) and options o. | |
Space * | next (void) |
Return next better solution (NULL, if none exists or search has been stopped) | |
~Restart (void) | |
Destructor. | |
Protected Attributes | |
Space * | root |
Root node. | |
Space * | best |
So-far best solution. |
Depth-first restart best solution search engine implementation.
Gecode::Search::Sequential::Restart::Restart | ( | Space * | s, |
size_t | sz, | ||
const Search::Options & | o | ||
) | [inline] |
Initialize engine for space s (with size sz) and options o.
Definition at line 62 of file restart.hh.
Gecode::Search::Sequential::Restart::~Restart | ( | void | ) | [inline] |
Destructor.
Definition at line 80 of file restart.hh.
Space * Gecode::Search::Sequential::Restart::next | ( | void | ) | [inline] |
Return next better solution (NULL, if none exists or search has been stopped)
Reimplemented from Gecode::Search::Sequential::DFS.
Definition at line 67 of file restart.hh.
Space* Gecode::Search::Sequential::Restart::root [protected] |
Root node.
Definition at line 49 of file restart.hh.
Space* Gecode::Search::Sequential::Restart::best [protected] |
So-far best solution.
Definition at line 51 of file restart.hh.