Sequential A* search.
More...
#include <gecode/search/seq/astar.hh>
|
| unsigned long long int | fail |
| | Number of failed nodes in search tree.
|
| unsigned long long int | node |
| | Number of nodes expanded.
|
| unsigned long int | depth |
| | Maximum depth of search stack.
|
| unsigned long int | restart |
| | Number of restarts.
|
| unsigned long int | nogood |
| | Number of no-goods posted.
|
| unsigned long long int | propagate |
| | Number of propagator executions.
|
| bool | _stopped |
| | Whether engine has been stopped.
|
| unsigned long int | root_depth |
| | Depth of root node (for work stealing).
|
Sequential A* search.
Definition at line 46 of file astar.hh.
◆ AStar()
| Gecode::Search::Seq::AStar::AStar |
( |
Space * | s, |
|
|
const Options & | o ) |
Initialize for space s with options o.
Definition at line 107 of file astar.cpp.
◆ next()
| Space * Gecode::Search::Seq::AStar::next |
( |
void | | ) |
|
Return next better solution (nullptr if none or stopped).
Definition at line 154 of file astar.cpp.
◆ statistics()
| Statistics Gecode::Search::Seq::AStar::statistics |
( |
void | | ) |
const |
Return statistics.
Definition at line 211 of file astar.cpp.
◆ constrain()
| void Gecode::Search::Seq::AStar::constrain |
( |
const Space & | b | ) |
|
Constrain future solutions to be better than b.
Definition at line 216 of file astar.cpp.
◆ reset()
| void Gecode::Search::Seq::AStar::reset |
( |
Space * | s | ) |
|
Reset engine to restart at space s.
Definition at line 223 of file astar.cpp.
◆ nogoods()
| NoGoods & Gecode::Search::Seq::AStar::nogoods |
( |
void | | ) |
|
Return no-goods (none).
Definition at line 239 of file astar.cpp.
The documentation for this class was generated from the following files: