void add_node(dpNode *_n)
void DumpAll(ostream &ost)
void remove_node_single(dpNode *node)
dpNode * BestGoal(dpNode *ref=0)
Extract the goal with the smallest cost (if any).
void DumpQueue(ostream &ost)
void remove_node(dpNode *node)
dpNode * next_breadth(dpNode *refnode)
void SetStartNode(dpNode *_n)
Set the initial node for search.
dpQueue * smallest_queue()
void add_queue(dpQueue *_q)