This is an implementation of the A* search algorithm. More...
#include <utils/search/astar.h>
Classes | |
struct | Cmp |
Comparison structure to be used for the ordering on AStar::openList. | |
Public Member Functions | |
AStar () | |
Constructor. | |
~AStar () | |
Destructor. | |
std::vector< AStarState * > | solve (AStarState *initialState) |
Solves a situation given by the initial state with AStar, and returns a vector of AStarStates that solve the problem. |
This is an implementation of the A* search algorithm.
Definition at line 36 of file astar.h.
fawkes::AStar::AStar | ( | ) |
fawkes::AStar::~AStar | ( | ) |
std::vector< AStarState * > fawkes::AStar::solve | ( | AStarState * | initialState | ) |
Solves a situation given by the initial state with AStar, and returns a vector of AStarStates that solve the problem.
initialState | pointer of AStarState to the initial state |