/**
* Checks if a node is legitimate. A node is illegitimate if its hamming distance to a pruned node
* is 1 (this is, the node is a child of a previously pruned node).
*
* @param f node to check its legitimacy
* @return true if the node is legitimate, false otherwise.
*/
private boolean legitimate(boolean f[]) {
boolean feas = true;
for (int i = 0; i < pruned.size() && feas; i++) {
if (hamming(pruned.elementAt(i), f) == 1) feas = false;
}
return feas;
}
