Fix filtering (always done in q,p)

Author: IoannisPanagiotas

algo/src/main/java/org/neo4j/gds/hdbscan/DualTreeMSTAlgorithm.java

@@ -212,8 +212,7 @@ boolean score(KdNode kdNodeQ, KdNode kdNodeR) {
 
     }
 
-    private boolean filterNodesOnCoreValue(long node) {
-        var component = unionFind.setIdOf(node);
+    private boolean filterNodesOnCoreValue(long node, long component) {
         return coreValues.get(node) < closestDistanceTracker.componentClosestDistance(component);
     }
 
@@ -223,17 +222,18 @@ void traversalLeafLeafStep(KdNode kdNodeQ, KdNode kdNodeR) {
         var qEnd = kdNodeQ.end();
         for (long qIndex = qStart; qIndex < qEnd; ++qIndex) {
             var qPoint = kdTree.nodeAt(qIndex);
-            if (!filterNodesOnCoreValue(qPoint)) {
+            var qComp = unionFind.setIdOf(qPoint);
+
+            if (!filterNodesOnCoreValue(qPoint, qComp)) {
                 continue;
             }
 
             var rStart = kdNodeR.start();
             var rEnd = kdNodeR.end();
-            var qComp = unionFind.setIdOf(qPoint);
             var qArr = nodePropertyValues.doubleArrayValue(qPoint);
             for (long rIndex = rStart; rIndex < rEnd; ++rIndex) {
                 var rPoint = kdTree.nodeAt(rIndex);
-                if (filterNodesOnCoreValue(rPoint)) {
+                if (filterNodesOnCoreValue(rPoint,qComp)) {
                     baseCase(qPoint, rPoint, qComp, qArr);
                 }
             }