Add triangle count in compute facade

Author: IoannisPanagiotas

algo/src/main/java/org/neo4j/gds/triangle/TriangleCountResult.java

@@ -20,8 +20,13 @@
 package org.neo4j.gds.triangle;
 
 import org.neo4j.gds.collections.haa.HugeAtomicLongArray;
+import org.neo4j.gds.core.concurrency.Concurrency;
+import org.neo4j.gds.core.utils.paged.ParalleLongPageCreator;
 
 public record TriangleCountResult(
         HugeAtomicLongArray localTriangles,
         long globalTriangles
-    ) {}
+    ) {
+
+    public static TriangleCountResult EMPTY = new TriangleCountResult(HugeAtomicLongArray.of(0, ParalleLongPageCreator.passThrough(new Concurrency(1))),0);
+}

algorithms-compute-facade/src/main/java/org/neo4j/gds/community/CommunityComputeFacade.java

@@ -68,9 +68,12 @@
 import org.neo4j.gds.scc.Scc;
 import org.neo4j.gds.scc.SccParameters;
 import org.neo4j.gds.termination.TerminationFlag;
+import org.neo4j.gds.triangle.IntersectingTriangleCount;
 import org.neo4j.gds.triangle.LocalClusteringCoefficient;
 import org.neo4j.gds.triangle.LocalClusteringCoefficientParameters;
 import org.neo4j.gds.triangle.LocalClusteringCoefficientResult;
+import org.neo4j.gds.triangle.TriangleCountParameters;
+import org.neo4j.gds.triangle.TriangleCountResult;
 
 import java.util.Optional;
 import java.util.concurrent.CompletableFuture;
@@ -549,4 +552,38 @@ CompletableFuture<TimedAlgorithmResult<HugeLongArray>> scc(
         );
     }
 
+    CompletableFuture<TimedAlgorithmResult<TriangleCountResult>> triangleCount(
+        Graph graph,
+        TriangleCountParameters parameters,
+        JobId jobId,
+        boolean logProgress
+    ) {
+
+        if (graph.isEmpty()) {
+            return CompletableFuture.completedFuture(TimedAlgorithmResult.empty(TriangleCountResult.EMPTY));
+        }
+
+        var progressTracker = progressTrackerFactory.create(
+            tasks.triangleCount(graph),
+            jobId,
+            parameters.concurrency(),
+            logProgress
+        );
+
+        var algorithm = IntersectingTriangleCount.create(
+            graph,
+            parameters.concurrency(),
+            parameters.maxDegree(),
+            parameters.labelFilter(),
+            DefaultPool.INSTANCE,
+            progressTracker,
+            terminationFlag
+        );
+
+        return algorithmCaller.run(
+            algorithm::compute,
+            jobId
+        );
+    }
+
 }

algorithms-compute-facade/src/test/java/org/neo4j/gds/community/CommunityComputeFacadeEmptyGraphTest.java

@@ -55,6 +55,8 @@
 import org.neo4j.gds.termination.TerminationFlag;
 import org.neo4j.gds.triangle.LocalClusteringCoefficientParameters;
 import org.neo4j.gds.triangle.LocalClusteringCoefficientResult;
+import org.neo4j.gds.triangle.TriangleCountParameters;
+import org.neo4j.gds.triangle.TriangleCountResult;
 
 import static org.assertj.core.api.Assertions.assertThat;
 import static org.mockito.Mockito.mock;
@@ -323,4 +325,22 @@ void scc(){
         verifyNoInteractions(progressTrackerFactoryMock);
         verifyNoInteractions(algorithmCallerMock);
     }
+
+    @Test
+    void triangleCount(){
+
+        var future = facade.triangleCount(
+            graph,
+            mock(TriangleCountParameters.class),
+            jobIdMock,
+            false
+        );
+
+        var results = future.join();
+
+        assertThat(results.result()).isEqualTo(TriangleCountResult.EMPTY);
+        verifyNoInteractions(progressTrackerFactoryMock);
+        verifyNoInteractions(algorithmCallerMock);
+    }
+
 }

algorithms-compute-facade/src/test/java/org/neo4j/gds/community/CommunityComputeFacadeTest.java

@@ -53,6 +53,7 @@
 import org.neo4j.gds.scc.SccParameters;
 import org.neo4j.gds.termination.TerminationFlag;
 import org.neo4j.gds.triangle.LocalClusteringCoefficientParameters;
+import org.neo4j.gds.triangle.TriangleCountParameters;
 
 import java.util.List;
 import java.util.Optional;
@@ -394,4 +395,23 @@ void scc(){
         assertThat(results.computeMillis()).isNotNegative();
     }
 
+    @Test
+    void triangleCount(){
+        var future = facade.triangleCount(
+            graph,
+            new TriangleCountParameters(
+                new Concurrency(4),
+                10,
+                List.of()
+            ),
+            jobIdMock,
+            false
+        );
+
+        var results = future.join();
+
+        assertThat(results.result().globalTriangles()).isEqualTo(1L);
+        assertThat(results.computeMillis()).isNotNegative();
+    }
+
 }