Use a priority queue in MWIS to find the smallest cliques, instead of

iterating over them

An updatable priority queue is required to change the keys of elements
if the priority queue when making decisions or backtracking, hence why
std::priority_queue was not appropriate.