Fawkes API
Fawkes Development Version
|
#include <>>
Public Member Functions | |
AStar () | |
Constructor. More... | |
~AStar () | |
Destructor. More... | |
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. More... | |
This is an implementation of the A* search algorithm.
This is a high efficient implementation. Therefore this code does not always look very nice here. So be patient and try to understand what I was trying to implement here.
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 |
Definition at line 86 of file astar.cpp.
Referenced by fawkes::NavGraph::search_path().