This is the complete list of members for
dpMain, including all inherited members.
| add_node(dpNode *_n) | dpMain | [inline, protected] |
| add_queue(dpQueue *_q) | dpMain | [inline, protected] |
| BestGoal(dpNode *ref=0) | dpMain | [inline] |
| ClearAll() | dpMain | [inline, virtual] |
| dpMain() | dpMain | [inline] |
| dpNode class | dpMain | [friend] |
| dpQueue class | dpMain | [friend] |
| DumpAll(ostream &ost) | dpMain | [inline] |
| DumpQueue(ostream &ost) | dpMain | [inline] |
| DumpTrajectory(ostream &ost, dpNode *goal) | dpMain | |
| is_best(dpNode *ref, dpNode *target) | dpMain | [protected] |
| n_goals | dpMain | [protected] |
| n_nodes | dpMain | [protected] |
| next_breadth(dpNode *refnode) | dpMain | [inline, protected] |
| NumGoals() | dpMain | [inline] |
| NumNodes() | dpMain | [inline] |
| remove_node(dpNode *node) | dpMain | [inline, protected] |
| remove_node_single(dpNode *node) | dpMain | [inline, protected] |
| reset() | dpMain | [inline, protected] |
| Search(int _max_nodes=-1, int _max_goals=-1) | dpMain | |
| Search(double max_time) | dpMain | |
| SearchBreadthFirst(int _max_nodes=-1, int _max_goals=-1) | dpMain | |
| SearchDepthFirst(int _max_nodes=-1, int _max_goals=-1) | dpMain | |
| SetStartNode(dpNode *_n) | dpMain | [inline] |
| smallest_queue() | dpMain | [inline, protected] |
| start_node | dpMain | [protected] |
| top_queue | dpMain | [protected] |
| ~dpMain() | dpMain | [inline, virtual] |