heuristic.hh File Reference
#include <gecode/search.hh>#include <algorithm>#include <climits>#include <memory>#include <optional>Go to the source code of this file.
Classes | |
| class | Gecode::Search::Entry |
| Open node of a heuristic search engine. More... | |
| class | Gecode::Search::Priority |
| Order of open nodes: whether a is preferred to b. More... | |
| class | Gecode::Search::Incumbent |
| Best solution found so far. More... | |
| class | Gecode::Search::Entries |
| Stack of entries owning their spaces. More... | |
| class | Gecode::Search::Queue |
| Priority queue of open nodes for A*. More... | |
| class | Gecode::Search::Beam |
| Candidates for the next layer of CABS. More... | |
Namespaces | |
| namespace | Gecode |
| Gecode toplevel namespace | |
| namespace | Gecode::Search |
| Search engines | |
Functions | |
| bool | Gecode::Search::better (HeuristicGuidance::Sense s, std::int64_t a, std::int64_t b) |
| Whether bound a is better than bound b for objective direction s. | |
