#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.
dpQueue::dpQueue | ( | dpNode * | n | ) | [inline] |
dpQueue::~dpQueue | ( | ) | [inline] |
void dpQueue::add_queue | ( | dpQueue * | q | ) | [inline, protected] |
void dpQueue::dump | ( | ostream & | ost | ) | [inline, protected] |
dpQueue* dpQueue::larger_goal | ( | ) | [inline, protected] |
dpQueue* dpQueue::larger_goal_sub | ( | ) | [inline, protected] |
dpQueue* dpQueue::smallest | ( | ) | [inline, protected] |
dpQueue* dpQueue::smallest_goal | ( | ) | [inline, protected] |
int dpQueue::active [protected] |
dpQueue* dpQueue::larger_child [protected] |
dpNode* dpQueue::node [protected] |
dpQueue* dpQueue::parent [protected] |
dpQueue* dpQueue::smaller_child [protected] |