Make LP predict return sane root progress

Author: adamnsch

proc/machine-learning/src/main/java/org/neo4j/gds/ml/linkmodels/pipeline/predict/ExhaustiveLinkPrediction.java

@@ -76,6 +76,8 @@ ExhaustiveLinkPredictionResult predictLinks(
         Graph graph,
         LinkPredictionSimilarityComputer linkPredictionSimilarityComputer
     ) {
+        progressTracker.setSteps(graph.nodeCount());
+
         var predictionQueue = BoundedLongLongPriorityQueue.max(topN);
 
         var tasks = PartitionUtils.rangePartition(
@@ -139,7 +141,7 @@ public void run() {
                 );
             });
 
-            progressTracker.logProgress(partition.nodeCount());
+            progressTracker.logSteps(partition.nodeCount());
         }
 
         private LongHashSet largerNeighbors(long sourceId) {

proc/machine-learning/src/main/java/org/neo4j/gds/ml/linkmodels/pipeline/predict/LinkPredictionPredictPipelineExecutor.java

@@ -102,15 +102,15 @@ public static Task progressTask(
             taskName,
             Tasks.iterativeFixed(
                 "Execute node property steps",
-                () -> List.of(Tasks.leaf("Step")),
+                () -> List.of(Tasks.leaf("Step", 10 * graphStore.getUnion().relationshipCount())),
                 pipeline.nodePropertySteps().size()
             ),
             config.isApproximateStrategy()
                 ? Tasks.task(
                 "Approximate link prediction",
                 KnnFactory.knnTaskTree(graphStore.getUnion(), config.approximateConfig())
             )
-                : Tasks.leaf("Exhaustive link prediction", graphStore.nodeCount())
+                : Tasks.leaf("Exhaustive link prediction", graphStore.getUnion().nodeCount() * graphStore.getUnion().nodeCount() / 2)
         );
     }