AStar.h File Reference

#include <vector>
#include <deque>
#include <set>
#include <algorithm>
#include <functional>
#include <tr1/unordered_set>

Include dependency graph for AStar.h:

Go to the source code of this file.

Classes
struct	AStar::Node< State >
	Stores user state along with search context. More...
struct	AStar::Node< State >::CostCmp
	Search nodes should be sorted based on total cost (total). More...
struct	AStar::StateCmp< State, Cmp >
	For efficient lookup of existance of states in open or closed list, uses user's Cmp on the user state within the search node. More...
struct	AStar::StateHash< State >
	Calls State::hash(), which should return value distributed over size_t. More...
struct	AStar::StateEq< State >
	Tests equality of states using State::operator==. More...
struct	AStar::Results< State, Cmp >
	Search results, including unexpanded nodes. More...
Namespaces
namespace	AStar
	Holds data structures for search context, results, and implementation of A★ path planning algorithm, see AStar::astar.
Functions
template<class Context , class State , class Expand , class Heuristic , class Validate , class Cmp >
Results< State, Cmp >	AStar::astar (const Context &ctxt, const State &initial, const State &goal, Expand expand, Heuristic heuristic, Validate validate, const Cmp &, float bound=0)
	A★ search using custom comparison on State type.
template<class Context , class State , class Expand , class Heuristic , class Validate >
Results< State, std::less < State > >	AStar::astar (const Context &ctxt, const State &initial, const State &goal, Expand expand, Heuristic heuristic, Validate validate, float bound=0)
	A★ search using operator< to sort user State type.
template<class Context , class State >
Results< State, std::less < State > >	AStar::astar (const Context &ctxt, const State &initial, const State &goal, float bound=0)
	A★ search using operator< to sort user State type, assumes Context has functions named "expand" and "heuristic".
template<class Node , class State >
void	AStar::reconstruct (const Node *n, std::vector< State > &path, size_t depth=1)
	constructs path by following parent pointers from n; the specified node is included in the path