#include <dp.h>
Public Member Functions | |
dpQueue (dpNode *n) | |
~dpQueue () | |
Protected Member Functions | |
void | add_queue (dpQueue *q) |
void | dump (ostream &ost) |
dpQueue * | larger_goal () |
dpQueue * | larger_goal_sub () |
dpQueue * | smallest () |
dpQueue * | smallest_goal () |
Protected Attributes | |
int | active |
dpQueue * | larger_child |
dpNode * | node |
dpQueue * | parent |
dpQueue * | smaller_child |
Friends | |
class | dpMain |
class | dpNode |
Nodes for the node queue. Forms a binary tree for sorting the search nodes in the order of the total cost.