remove unneeeded field

Author: IoannisPanagiotas

algo/src/main/java/org/neo4j/gds/pricesteiner/EdgeEventsQueue.java

@@ -27,24 +27,21 @@ class EdgeEventsQueue {
 
     private final HugeObjectArray<PairingHeap> pairingHeaps;
     private final HugeLongPriorityQueue edgeEventsPriorityQueue;
-    private final ObjectArrayList<PairingHeapElement> helpingArray;
-    private long currentlyActive;
 
     EdgeEventsQueue(long nodeCount){
 
         this.pairingHeaps= HugeObjectArray.newArray(PairingHeap.class, 2*nodeCount);
         this.edgeEventsPriorityQueue = HugeLongPriorityQueue.min(2*nodeCount);
-        this.helpingArray= new ObjectArrayList<>(4096);
+        ObjectArrayList<PairingHeapElement> helpingArray = new ObjectArrayList<>(4096);
+
         for (int i=0;i<nodeCount;i++){
             pairingHeaps.set(i, new PairingHeap(helpingArray));
         }
-        currentlyActive = nodeCount;
-    }
-    long currentlyActive(){
-        return currentlyActive;
+
     }
+
     double nextEventTime(){
-        return  edgeEventsPriorityQueue.cost(edgeEventsPriorityQueue.top());
+        return edgeEventsPriorityQueue.cost(edgeEventsPriorityQueue.top());
     }
 
     long top(){
@@ -80,6 +77,7 @@ void addWithCheck(long s,  long edgePart, double w){
                edgeEventsPriorityQueue.set(s, w);
          }
      }
+
      void addWithoutCheck(long s,  long edgePart, double w){
          var pairingHeapOfs  = pairingHeaps.get(s);
          pairingHeapOfs.add(edgePart,w);
@@ -97,13 +95,11 @@ void mergeAndUpdate(long newCluster, long cluster1,long cluster2){
         deactivateCluster(cluster2);
 
         edgeEventsPriorityQueue.add(newCluster, pairingHeaps.get(newCluster).minValue());
-        currentlyActive--;
     }
 
     void deactivateCluster(long clusterId){
         // very-very bad way of removing from common heap-of-heaps
         edgeEventsPriorityQueue.set(clusterId,Double.MAX_VALUE); //ditto
-
     }
 
     void performInitialAssignment(long nodeCount){

algo/src/test/java/org/neo4j/gds/pricesteiner/EdgeEventsQueueTest.java

@@ -109,7 +109,6 @@ void mergeShouldNotKeepOldCopiesAround(){
         edgeEventsQueue.mergeAndUpdate(11,0,1);
 
         edgeEventsQueue.pop();
-        assertThat(edgeEventsQueue.currentlyActive()).isEqualTo(9L);
         assertThat(edgeEventsQueue.minOf(0)).isEqualTo(edgeEventsQueue.minOf(1)).isEqualTo(Double.MAX_VALUE);
 
         assertThat(edgeEventsQueue.top()).isEqualTo(11L);
@@ -137,7 +136,6 @@ void shouldReAddCorrectly(){
         assertThat(edgeEventsQueue.top()).isEqualTo(0);
         assertThat(edgeEventsQueue.nextEventTime()).isEqualTo(10);
 
-
     }
 
 }