34 namespace Gecode {
namespace Int {
namespace ViewValGraph {
45 : _next_edge(n), sd(s,d) {
76 return sd.is_set() || (v->
comp == sd.ptr(v)->comp);
102 return static_cast<Edge<View>*
>(BiLink::next());
114 return home.ralloc(s);
Edges in view-value graph.
void add(BiLink *l)
Add l after this element.
int n
Number of negative literals for node type.
View nodes in view-value graph.
Node * x
Pointer to corresponding Boolean expression node.
Value nodes in view-value graph.
Gecode toplevel namespace
Edge(ValNode< View > *v, ViewNode< View > *x)
Construct new edge between x and v.
Base-class for nodes (both view and value nodes)