* fragment that the smallest fragment would necessarily be no bigger
* than our best solution. That is, we reject candidates where any of
* the hamming weights of the adjacency bitmap words are too large.
* fragment that the smallest fragment would necessarily be no bigger
* than our best solution. That is, we reject candidates where any of
* the hamming weights of the adjacency bitmap words are too large.