Trees

Author: williamfiset

com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenter.java

@@ -32,8 +32,13 @@ public static List<Integer> findTreeCenters(List<List<Integer>> tree) {
     // until only the centers remain.
     while (processedLeafs < n) {
       List<Integer> newLeaves = new ArrayList<>();
-      for (int node : leaves)
-        for (int neighbor : tree.get(node)) if (--degrees[neighbor] == 1) newLeaves.add(neighbor);
+      for (int node : leaves) {
+        for (int neighbor : tree.get(node)) {
+          if (--degrees[neighbor] == 1) {
+            newLeaves.add(neighbor);
+          }
+        }
+      }
       processedLeafs += newLeaves.size();
       leaves = newLeaves;
     }