16 #include "API/Search/AStar/State.hpp"
34 TreeNode* getParent()
const {
return _Parent;}
55 TreeNode* getTreeNode() {
return _Node; }
73 return x.getTreeNode()->getState()->f() > y.getTreeNode()->getState()->f();
103 void setGoal(
API::State* goal) { _Goal = goal; }
117 std::vector<API::State*> _Solution;
118 std::vector<API::State*> _Explored;
120 enum {NOT_FOUND,FOUND} _AStarState;
Basic block to be used in the priority queue.
Definition: AStar.hpp:48
std::vector< API::State * > solve(API::State *initial_state)
A Star solving function (main)
Definition: AStar.cpp:76
Function used for sorting tree nodes in the priority queue.
Definition: AStar.hpp:68
This class keeps a pointer to the A-star search tree, an instant of priority_queue of "Queue_Element"...
Definition: AStar.hpp:84
++
Definition: State.hpp:20
This class is the node class to implement the search tree.
Definition: AStar.hpp:27