public void removeRestrictionList(Node n){
  while (!nodeCausingRestriction.empty() && nodeCausingRestriction.peek() == n) {
    neighbourLists.pop();
    nodeCausingRestriction.pop();
  }
}

public void removeRestrictionList ( Node n ) { while ( ! nodeCausingRestriction . empty ( ) && nodeCausingRestriction . peek ( ) == n ) { neighbourLists . pop ( ) ; nodeCausingRestriction . pop ( ) ; } }
removes the constraining list of candidate nodes induced by the graph node
