Rename tasks

Author: jjaderberg

algo/src/main/java/org/neo4j/gds/steiner/ShortestPathsSteinerAlgorithm.java

@@ -115,7 +115,7 @@ private BitSet createTerminals() {
     public SteinerTreeResult compute() {
         progressTracker.beginSubTask("SteinerTree");
         if (applyRerouting) {
-            progressTracker.beginSubTask("Main");
+            progressTracker.beginSubTask("Traverse");
         }
         HugeLongArray parent = HugeLongArray.newArray(graph.nodeCount());
         HugeDoubleArray parentCost = HugeDoubleArray.newArray(graph.nodeCount());
@@ -138,7 +138,7 @@ public SteinerTreeResult compute() {
         });
 
         if (applyRerouting) {
-            progressTracker.endSubTask("Main");
+            progressTracker.endSubTask("Traverse");
             reroute(parent, parentCost, totalCost, effectiveNodeCount);
         }
         progressTracker.endSubTask("SteinerTree");
@@ -298,7 +298,7 @@ private void reroute(
         DoubleAdder totalCost,
         LongAdder effectiveNodeCount
     ) {
-        progressTracker.beginSubTask("Rerouting");
+        progressTracker.beginSubTask("Reroute");
         //First, represent the tree as an LinkCutTree:
         // This is a dynamic tree (can answer connectivity like UnionFind)
         // but can also do some other cool stuff like answering path queries
@@ -330,7 +330,7 @@ private void reroute(
         if (didReroutes.isTrue()) {
             cutNodesAfterRerouting(parent, parentCost, totalCost, effectiveNodeCount);
         }
-        progressTracker.endSubTask("Rerouting");
+        progressTracker.endSubTask("Reroute");
     }
 
 

algo/src/main/java/org/neo4j/gds/steiner/SteinerTreeAlgorithmFactory.java

@@ -69,8 +69,8 @@ public Task progressTask(Graph graph, CONFIG config) {
         if (config.applyRerouting()) {
             long nodeCount = graph.nodeCount();
             return Tasks.task(taskName(), List.of(
-                Tasks.leaf("Main", targetNodesSize),
-                Tasks.leaf("Rerouting", nodeCount)
+                Tasks.leaf("Traverse", targetNodesSize),
+                Tasks.leaf("Reroute", nodeCount)
             ));
         } else {
             return Tasks.leaf(taskName(), targetNodesSize);