46 while (i() <
nodes()) {
47 int iv = i(), nv =
n();
48 if ((
n() <
nodes()) && (iv == nv)) {
50 }
else if ((
n() <
nodes()) && (iv > nv)) {
65 p.excl(iv);
x.incl(iv);
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
void excl(int i, unsigned int w)
Exclude node i with weight w.
void incl(int i, unsigned int w)
Include node i with weight w.
static bool iwn(NodeSet &iwa, const NodeSet &a, NodeSet &iwb, const NodeSet &b, const NodeSet &c, int n)
void allocate(Region &r, int n)
Allocate node set for n nodes.
Clique cur
Current clique.
ExecStatus clique(void)
Report the current clique.
int nodes(void) const
Return number of nodes.
int pivot(const NodeSet &a, const NodeSet &b) const
Find a pivot node with maximal degree from a or b.
Node * node
The nodes in the graph.
ExecStatus bk(NodeSet &p, NodeSet &x)
Run Bosch-Kerbron algorithm for finding max cliques.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Gecode toplevel namespace
@ ES_OK
Execution is okay.
Post propagator for SetVar x