Introduce a cursor queue tracking function

Author: IoannisPanagiotas

core/src/main/java/org/neo4j/gds/core/huge/CompositeAdjacencyCursor.java

@@ -51,9 +51,9 @@ public List<AdjacencyCursor> cursors() {
         return cursors;
     }
 
-    void exchangeCursor(AdjacencyCursor oldCursor, AdjacencyCursor newCursor) {
-        cursorQueue.remove(oldCursor); //remove the old cursor
-        cursorQueue.add(newCursor);     // add the new one
+    void updateCursorsQueue() {
+        cursorQueue.clear();
+        cursorQueue.addAll(cursors);
     }
     @Override
     public int size() {

core/src/main/java/org/neo4j/gds/core/huge/CompositeAdjacencyList.java

@@ -125,17 +125,19 @@ public CompositeAdjacencyCursor adjacencyCursor(@Nullable AdjacencyCursor reuse,
         if (reuse instanceof CompositeAdjacencyCursor) {
             var compositeReuse = (CompositeAdjacencyCursor) reuse;
             var iter = compositeReuse.cursors().listIterator();
+            boolean cursorsAreUpdated = false;
             while (iter.hasNext()) {
                 var index = iter.nextIndex();
                 var cursor = iter.next();
                 var newCursor = adjacencyLists.get(index).adjacencyCursor(cursor, node, fallbackValue);
                 if (newCursor != cursor) {
-                    var newCursor1 = adjacencyCursorWrapperFactory.create(newCursor);
-                    iter.set(newCursor1);
-                    compositeReuse.exchangeCursor(cursor, newCursor1);
-                    
+                    iter.set(adjacencyCursorWrapperFactory.create(newCursor));
+                    cursorsAreUpdated = true;
                 }
             }
+            if (cursorsAreUpdated) {
+                compositeReuse.updateCursorsQueue();
+            }
             return compositeReuse;
         }
         return adjacencyCursor(node, fallbackValue);