The original CLASSIX software does not account for minPTs merging. The algorithm used to find connections between two indexes cannot determine a connection if they were merged due to minPts, and the algorithm returns an error saying that the points were merged by minPts redistribution, and a path cannot be found connecting them. In the Tanimoto implementation I had solved this by having a custom bfs algorithm which is porvided in the code. We need to integrate this into the system.