plist_insert_back(rpeo, node);
} while(node_is_reduced(node));
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
/* Check whether we can merge a neighbor into the current node. */
node = merged_node;
merged_node = NULL;
- assert(node);
if (node_is_reduced(node))
return;