Skip deleted edges

Author: IoannisPanagiotas

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

@@ -71,7 +71,13 @@ GrowthResult grow() {
                 long uPart = edgeEventsQueue.topEdgePart();
                 long vPart = otherEdgePart(uPart);
                 long u = edgeParts.get(uPart);
-                long v = edgeParts.get(vPart);   //TODO: If we have already  processed other edge part (tight or delete), find shortcut to skip
+                long v = edgeParts.get(vPart);
+
+                edgeEventsQueue.pop();
+
+                if (u<0 || v<0) {
+                    continue;
+                }
 
                 ClusterMoatPair cmu = clusterStructure.sumOnEdgePart(u,moat);
                 ClusterMoatPair cmv = clusterStructure.sumOnEdgePart(v,moat);
@@ -82,9 +88,10 @@ GrowthResult grow() {
                 var vCluster = cmv.cluster();
                 var vClusterSum = cmv.totalMoat();
 
-                edgeEventsQueue.pop();
 
                 if (vCluster == uCluster) {
+                    edgeParts.set(uPart,-u);
+                    edgeParts.set(vPart,-v);
                     continue;
                 }
 
@@ -103,6 +110,7 @@ GrowthResult grow() {
                         clusterStructure.active(vCluster)
                     );
                 }
+
             }
 
         }
@@ -173,6 +181,8 @@ private void mergeClusters(
         clusterEventsPriorityQueue.add(newCluster, clusterStructure.tightnessTime(newCluster, moat));
 
         addToTree(edgeId);
+        edgeParts.set(2*edgeId,-edgeParts.get(2*edgeId));
+        edgeParts.set(2*edgeId+1,-edgeParts.get(2*edgeId+1));
     }
 
     private void generateNewEdgeEvents(

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

@@ -56,8 +56,8 @@ static TreeStructure createTree(GrowthResult growthResult,long nodeCount, IdMap
 
         for (long i =0; i<numberOfTreeEdges;++i){
             var edgeId = treeEdges.get(i);
-            var  u = edgeParts.get(2*edgeId);
-            var  v = edgeParts.get(2*edgeId+1);
+            var  u = Math.abs(edgeParts.get(2*edgeId));
+            var  v = Math.abs(edgeParts.get(2*edgeId+1));
             if (activePredicate.test(u) && activePredicate.test(v)){
                     degree.addTo(u,1);
                     degree.addTo(v,1);