34#ifndef GECODE_GIST_NODECURSOR_HH
35#define GECODE_GIST_NODECURSOR_HH
50 unsigned int _alternative;
206 int c_d,
int a_d,
bool clear,
Static reference to the currently best space.
BranchLabelCursor(VisualNode *theNode, BestNode *curBest, int c_d, int a_d, bool clear, VisualNode::NodeAllocator &na)
Constructor.
void processCurrentNode(void)
void processCurrentNode(void)
Dispose node.
DisposeCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void processCurrentNode(void)
Process node.
HideFailedCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na, bool onlyDirtyNodes)
Constructor.
bool mayMoveDownwards(void)
Test if the cursor may move to the first child node.
void processCurrentNode(void)
Do nothing.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
NextSolCursor(VisualNode *theNode, bool backwards, const VisualNode::NodeAllocator &na)
Constructor.
void moveSidewards(void)
Move cursor to the first sibling.
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
void moveDownwards(void)
Move cursor to the first child node.
const Node::NodeAllocator & na
The node allocator.
void moveDownwards(void)
Move cursor to the first child node.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
NodeCursor(Node *theNode, const typename Node::NodeAllocator &na)
Construct cursor, initially set to theNode.
Node * node(void)
Return current node.
unsigned int alternative(void)
Return current alternative.
Node * startNode(void)
Return start node.
void moveSidewards(void)
Move cursor to the first sibling.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
void moveUpwards(void)
Move cursor to the parent node.
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
Base class for nodes of the search tree.
NodeAllocatorBase< VisualNode > NodeAllocator
int choice
Number of choice nodes.
void moveDownwards(void)
Move cursor to the first child node.
int failed
Number of failed nodes.
StatCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
int depth
Depth of the search tree.
void processCurrentNode(void)
Collect statistics.
int open
Number of open nodes.
int solved
Number of solved nodes.
void moveUpwards(void)
Move cursor to the parent node.
UnhideAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
void processCurrentNode(void)
Process node.
void processCurrentNode(void)
Process node.
UnstopAllCursor(VisualNode *theNode, const VisualNode::NodeAllocator &na)
Constructor.
Node class that supports visual layout
The Gecode Interactive Search Tool.
Gecode toplevel namespace