frontier.hh
Go to the documentation of this file.
Guidance for heuristic search engines (experimental).
Definition search.hh:1259
Node leased by a worker, or partially expanded node.
Definition frontier.hh:56
unsigned long long int revision
Incumbent revision the node is constrained with.
Definition frontier.hh:63
virtual Entry select(void)=0
Remove and return the next open node.
Space * next(void) override
Return next better solution (nullptr if none or stopped).
Definition frontier.cpp:331
void constrain(const Space &s) override
Constrain future solutions to be better than s.
Definition frontier.cpp:375
void publish(Space *s, std::int64_t b)
Make s with bound b the incumbent, if it improves.
Definition frontier.cpp:157
virtual void started(const Space &r)
Called with the root r when search starts.
Definition frontier.cpp:66
void terminate(void)
Stop all workers (must be called by subclass destructors).
Definition frontier.cpp:135
virtual bool advance(void)=0
Called when all work is done, return whether there is new work.
virtual void submit(const Entry &e, bool leased)=0
Add child e, or delete it; leased tells whether its parent is still leased.
bool limited(void) const override
Whether search stopped at the width or frontier limit.
Definition frontier.cpp:369
bool running
Whether search is running, being shut down, stopped, or limited.
Definition frontier.hh:112
static const unsigned int max_batch
Maximal number of children a worker collects before submitting.
Definition frontier.hh:132
Node whose alternatives are expanded one at a time.
Definition choice-expansion.hh:62
Queue with arbitrary number of elements.
Definition dynamic-queue.hpp:42
An interface for objects that can be run by a thread.
Definition thread.hpp:181
An interface for objects that can be called after a thread has terminated (after running the thread's...
Definition thread.hpp:168
Definition astar.cpp:43
Search engines
Gecode toplevel namespace
