38 #ifndef GECODE_GIST_NODECURSOR_HH 39 #define GECODE_GIST_NODECURSOR_HH 43 namespace Gecode {
namespace Gist {
54 unsigned int _alternative;
103 void processCurrentNode(
void);
115 void processCurrentNode(
void);
128 void processCurrentNode(
void);
146 void processCurrentNode(
void);
184 void processCurrentNode(
void);
210 int c_d,
int a_d,
bool clear,
214 void processCurrentNode(
void);
227 void processCurrentNode(
void);
bool mayMoveDownwards(void)
Test if cursor may move to the first child node.
Static reference to the currently best space.
void moveUpwards(void)
Move cursor to the parent node.
NodeAllocatorBase< VisualNode > NodeAllocator
void moveDownwards(void)
Move cursor to the first child node.
int depth
Depth of the search tree.
bool mayMoveSidewards(void)
Test if cursor may move to the first sibling.
Base class for nodes of the search tree.
A cursor that marks failed subtrees as hidden.
A cursor that collects statistics.
bool mayMoveUpwards(void)
Test if the cursor may move to the parent node.
int n
Number of negative literals for node type.
const Node::NodeAllocator & na
The node allocator.
const unsigned int a_d
Create a clone during recomputation if distance is greater than a_d (adaptive distance) ...
struct Gecode::@519::NNF::@60::@62 a
For atomic nodes.
Node * startNode(void)
Return start node.
A cursor that frees all memory.
void moveSidewards(void)
Move cursor to the first sibling.
A cursor that marks all nodes in the tree as not stopping.
int open
Number of open nodes.
A cursor that can be run over a tree.
A cursor that marks all nodes in the tree as not hidden.
Node class that supports visual layout
int choice
Number of choice nodes.
const unsigned int c_d
Create a clone after every c_d commits (commit distance)
A cursor that finds the next solution.
int failed
Number of failed nodes.
Node * node(void)
Return current node.
NodeCursor(Node *theNode, const typename Node::NodeAllocator &na)
Construct cursor, initially set to theNode.
Gecode toplevel namespace
unsigned int alternative(void)
Return current alternative.
A cursor that labels branches.
int solved
Number of solved nodes.