Randomized extension for continuous refinement of the solution for BLM-Solve

As we know the hierarchical BLM solver solves the problem bottom up and works on the entire square. In this feature to further refine the solution we implement the following. 1. Solve the problem bottom-up for the first time 2. Randomly pick a location, and randomly choose a width of the square, now apply the rando...

Fast Global Distance Table Builder for BLM-Solve

The current code tries to build the GDT table by scanning the input string file several times. The main motive behind doing that is to avoid keeping the strings in memory. I now want to improve the building of this table by 'mmap' ing the file and building the GDT table much faster.