radial: Correct recursive remvoe overlap.

eclipse · Sep 21, 2023 · 7e0e1a7 · 7e0e1a7
1 parent c2c49e4
commit 7e0e1a7
Showing 1 changed file with 1 addition and 3 deletions.
diff --git a/...l/src/org/eclipse/elk/alg/radial/intermediate/overlaps/RadiusExtensionOverlapRemoval.java b/...l/src/org/eclipse/elk/alg/radial/intermediate/overlaps/RadiusExtensionOverlapRemoval.java
@@ -74,19 +74,17 @@ public void extend(final ElkNode graph, final List<ElkNode> nodes, IElkProgressM
             Set<ElkNode> nextLevelNodes = RadialUtil.getNextLevelNodeSet(nodes);
             // Calculate the moved distance which is the amount all children and grandchildren have to be moved.
             int index = 1;
-            while (!nextLevelNodes.isEmpty()) {
+            if (!nextLevelNodes.isEmpty()) {
                 for(ElkNode nextLevelNode : nextLevelNodes) {
                     moveNode(nextLevelNode, movedDistance);
                 }
                 progressMonitor.logGraph(graph, "Child movement " + index);
-                nextLevelNodes = RadialUtil.getNextLevelNodeSet(new ArrayList<>(nextLevelNodes));
                 index++;
             }            
 
             if (sorter != null) {
                 sorter.sort(new ArrayList<>(nextLevelNodes));
             }
-            progressMonitor.logGraph(graph, "After ancestor movement");
             extend(graph, new ArrayList<>(nextLevelNodes), progressMonitor);
         }
     }