Add remaining transformer builders

Author: vnickolov

procedures/pushback-procedures-facade/src/main/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/KSpanningTreeWriteResultTransformer.java

@@ -0,0 +1,42 @@
+/*
+ * Copyright (c) "Neo4j"
+ * Neo4j Sweden AB [http://neo4j.com]
+ *
+ * This file is part of Neo4j.
+ *
+ * Neo4j is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.neo4j.gds.procedures.algorithms.pathfinding.write;
+
+import org.neo4j.gds.api.Graph;
+import org.neo4j.gds.api.GraphStore;
+import org.neo4j.gds.kspanningtree.KSpanningTreeWriteConfig;
+import org.neo4j.gds.pathfinding.KSpanningTreeWriteStep;
+import org.neo4j.gds.procedures.algorithms.pathfinding.KSpanningTreeWriteResult;
+import org.neo4j.gds.result.TimedAlgorithmResult;
+import org.neo4j.gds.results.ResultTransformer;
+import org.neo4j.gds.results.ResultTransformerBuilder;
+import org.neo4j.gds.spanningtree.SpanningTree;
+
+import java.util.stream.Stream;
+
+class KSpanningTreeWriteResultTransformer implements ResultTransformerBuilder<TimedAlgorithmResult<SpanningTree>, Stream<KSpanningTreeWriteResult>> {
+
+    KSpanningTreeWriteResultTransformer(KSpanningTreeWriteStep writeStep, KSpanningTreeWriteConfig config) {}
+
+    @Override
+    public ResultTransformer<TimedAlgorithmResult<SpanningTree>, Stream<KSpanningTreeWriteResult>> build(Graph graph, GraphStore graphStore) {
+        return ar -> Stream.empty();
+    }
+}

procedures/pushback-procedures-facade/src/main/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/PushbackPathFindingWriteProcedureFacade.java

@@ -155,7 +155,15 @@ public Stream<KSpanningTreeWriteResult> kSpanningTree(
             requestScopedDependencies.terminationFlag()
         );
 
-        return Stream.empty();
+        return businessFacade.kSpanningTree(
+            GraphName.parse(graphName),
+            config.toGraphParameters(),
+            config.relationshipWeightProperty(),
+            config.toKSpanningTreeParameters(),
+            config.jobId(),
+            config.logProgress(),
+            new KSpanningTreeWriteResultTransformer(writeStep, config)
+        ).join();
     }
 
 
@@ -204,7 +212,15 @@ public Stream<StandardWriteRelationshipsResult> singlePairShortestPathAStar(
             config.jobId()
         );
 
-        return Stream.empty();
+        return businessFacade.singlePairShortestPathAStar(
+            GraphName.parse(graphName),
+            config.toGraphParameters(),
+            config.relationshipWeightProperty(),
+            config.toParameters(),
+            config.jobId(),
+            config.logProgress(),
+            new ShortestPathWriteResultTransformer(writeStep)
+        ).join();
     }
 
     public Stream<StandardWriteRelationshipsResult> singlePairShortestPathDijkstra(
@@ -225,7 +241,15 @@ public Stream<StandardWriteRelationshipsResult> singlePairShortestPathDijkstra(
             config.jobId()
         );
 
-        return Stream.empty();
+        return businessFacade.singlePairShortestPathDijkstra(
+            GraphName.parse(graphName),
+            config.toGraphParameters(),
+            config.relationshipWeightProperty(),
+            config.toParameters(),
+            config.jobId(),
+            config.logProgress(),
+            new ShortestPathWriteResultTransformer(writeStep)
+        ).join();
     }
 
     public Stream<StandardWriteRelationshipsResult> singlePairShortestPathYens(
@@ -247,7 +271,15 @@ public Stream<StandardWriteRelationshipsResult> singlePairShortestPathYens(
             config.jobId()
         );
 
-        return Stream.empty();
+        return businessFacade.singlePairShortestPathYens(
+            GraphName.parse(graphName),
+            config.toGraphParameters(),
+            config.relationshipWeightProperty(),
+            config.toParameters(),
+            config.jobId(),
+            config.logProgress(),
+            new ShortestPathWriteResultTransformer(writeStep)
+        ).join();
     }
 
     public Stream<StandardWriteRelationshipsResult> singleSourceShortestPathDijkstra(
@@ -269,7 +301,15 @@ public Stream<StandardWriteRelationshipsResult> singleSourceShortestPathDijkstra
             config.jobId()
         );
 
-        return Stream.empty();
+        return businessFacade.singleSourceShortestPathDijkstra(
+            GraphName.parse(graphName),
+            config.toGraphParameters(),
+            config.relationshipWeightProperty(),
+            config.toSingleSourceParameters(),
+            config.jobId(),
+            config.logProgress(),
+            new ShortestPathWriteResultTransformer(writeStep)
+        ).join();
     }
 
     public Stream<SpanningTreeWriteResult> spanningTree(String graphName, Map<String, Object> configuration) {

procedures/pushback-procedures-facade/src/main/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/ShortestPathWriteResultTransformer.java

@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) "Neo4j"
+ * Neo4j Sweden AB [http://neo4j.com]
+ *
+ * This file is part of Neo4j.
+ *
+ * Neo4j is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.neo4j.gds.procedures.algorithms.pathfinding.write;
+
+import org.neo4j.gds.api.Graph;
+import org.neo4j.gds.api.GraphStore;
+import org.neo4j.gds.pathfinding.ShortestPathWriteStep;
+import org.neo4j.gds.paths.dijkstra.PathFindingResult;
+import org.neo4j.gds.procedures.algorithms.results.StandardWriteRelationshipsResult;
+import org.neo4j.gds.result.TimedAlgorithmResult;
+import org.neo4j.gds.results.ResultTransformer;
+import org.neo4j.gds.results.ResultTransformerBuilder;
+
+import java.util.stream.Stream;
+
+public class ShortestPathWriteResultTransformer implements ResultTransformerBuilder<TimedAlgorithmResult<PathFindingResult>, Stream<StandardWriteRelationshipsResult>> {
+    public ShortestPathWriteResultTransformer(ShortestPathWriteStep writeStep) {}
+
+    @Override
+    public ResultTransformer<TimedAlgorithmResult<PathFindingResult>, Stream<StandardWriteRelationshipsResult>> build(Graph graph, GraphStore graphStore) {
+        return ar -> Stream.empty();
+    }
+}