void add_node(dpNode *_n)
void DumpAll(ostream &ost)
void remove_node_single(dpNode *node)
int SearchDepthFirst(int _max_nodes=-1, int _max_goals=-1)
Depth-first search.
void DumpTrajectory(ostream &ost, dpNode *goal)
int Search(int _max_nodes=-1, int _max_goals=-1)
Dijkstra or A* search: find the node with the smallest cost.
int is_best(dpNode *ref, dpNode *target)
int SearchBreadthFirst(int _max_nodes=-1, int _max_goals=-1)
Breadth-first search.
void remove_node(dpNode *node)
dpNode * next_breadth(dpNode *refnode)
dpQueue * smallest_queue()