ADD: k into rank

src/mhtree/MHTree.java

@@ -88,7 +88,7 @@ public class MHTree extends Algorithm implements Serializable {
                 }
             } else {
                 for (Node child : ((InternalNode) node).getChildren()) {
-                    searchState.queue.add(new ObjectToNodeDistanceRank(searchState.queryObject, child));
+                    searchState.queue.add(new ObjectToNodeDistanceRank(searchState.queryObject, child, operation.getK()));
                 }
             }
         }
@@ -100,7 +100,7 @@ public class MHTree extends Algorithm implements Serializable {
         LocalAbstractObject queryObject = operation.getQueryObject();
 
         PriorityQueue<ObjectToNodeDistanceRank> queue = new PriorityQueue<>();
-        queue.add(new ObjectToNodeDistanceRank(queryObject, root));
+        queue.add(new ObjectToNodeDistanceRank(queryObject, root, operation.getK()));
 
         while (!queue.isEmpty()) {
             if (approxState != null && approxState.stop()) {
@@ -121,7 +121,7 @@ public class MHTree extends Algorithm implements Serializable {
                 }
             } else {
                 for (Node child : ((InternalNode) node).getChildren()) {
-                    queue.add(new ObjectToNodeDistanceRank(queryObject, child));
+                    queue.add(new ObjectToNodeDistanceRank(queryObject, child, operation.getK()));
                 }
             }
         }

src/mhtree/benchmarking/SearchState.java

@@ -16,7 +16,7 @@ public class SearchState {
 
     public SearchState(MHTree tree, ApproxKNNQueryOperation operation) {
         this.queue = new PriorityQueue<>();
-        this.queue.add(new ObjectToNodeDistanceRank(operation.getQueryObject(), tree.getRoot()));
+        this.queue.add(new ObjectToNodeDistanceRank(operation.getQueryObject(), tree.getRoot(), operation.getK()));
         this.queryObject = operation.getQueryObject();
         this.approxState = ApproxState.create(operation, tree);
         this.recall = 0d;