It turned out that the algorithm I use for computing biclique covers in the case of non-domino-free graphs had several bugs that hadn't turned up in my unit tests. I guess that speaks to the fact that nearly all of the graphs we've dealt with have been domino-free, and also that it's hard to come up with challenging cases for the dual algorithm on your own.
Resolves https://github.com/vgteam/GetBlunted/issues/28.
It turned out that the algorithm I use for computing biclique covers in the case of non-domino-free graphs had several bugs that hadn't turned up in my unit tests. I guess that speaks to the fact that nearly all of the graphs we've dealt with have been domino-free, and also that it's hard to come up with challenging cases for the dual algorithm on your own.