Comment cleanup

Author: williamfiset

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

@@ -31,8 +31,7 @@ public static List<Integer> findTreeCenters(List<List<Integer>> tree) {
 
     int processedLeafs = leaves.size();
 
-    // Remove leaf nodes and decrease the degree of
-    // each node adding new leaf nodes progressively
+    // Remove leaf nodes and decrease the degree of each node adding new leaf nodes progressively
     // until only the centers remain.
     while (processedLeafs < n) {
       List<Integer> newLeaves = new ArrayList<>();
@@ -78,29 +77,29 @@ public static void main(String[] args) {
     addUndirectedEdge(graph, 6, 8);
 
     // Centers are 2
-    System.out.println(findTreeCenters(graph) + "\n");
+    System.out.println(findTreeCenters(graph));
 
     // Centers are 0
     List<List<Integer>> graph2 = createEmptyTree(1);
-    System.out.println(findTreeCenters(graph2) + "\n");
+    System.out.println(findTreeCenters(graph2));
 
     // Centers are 0,1
     List<List<Integer>> graph3 = createEmptyTree(2);
     addUndirectedEdge(graph3, 0, 1);
-    System.out.println(findTreeCenters(graph3) + "\n");
+    System.out.println(findTreeCenters(graph3));
 
     // Centers are 1
     List<List<Integer>> graph4 = createEmptyTree(3);
     addUndirectedEdge(graph4, 0, 1);
     addUndirectedEdge(graph4, 1, 2);
-    System.out.println(findTreeCenters(graph4) + "\n");
+    System.out.println(findTreeCenters(graph4));
 
     // Centers are 1,2
     List<List<Integer>> graph5 = createEmptyTree(4);
     addUndirectedEdge(graph5, 0, 1);
     addUndirectedEdge(graph5, 1, 2);
     addUndirectedEdge(graph5, 2, 3);
-    System.out.println(findTreeCenters(graph5) + "\n");
+    System.out.println(findTreeCenters(graph5));
 
     // Centers are 2,3
     List<List<Integer>> graph6 = createEmptyTree(7);
@@ -110,6 +109,6 @@ public static void main(String[] args) {
     addUndirectedEdge(graph6, 3, 4);
     addUndirectedEdge(graph6, 4, 5);
     addUndirectedEdge(graph6, 4, 6);
-    System.out.println(findTreeCenters(graph6) + "\n");
+    System.out.println(findTreeCenters(graph6));
   }
 }