Tree isomorphism testing

Author: williamfiset

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

@@ -5,7 +5,7 @@
  *
  * <p>http://webhome.cs.uvic.ca/~wendym/courses/582/16/notes/582_12_tree_can_form.pdf
  *
- * This implementation uses a breadth first search on an undirected graph to generate the tree's
+ * <p>This implementation uses a breadth first search on an undirected graph to generate the tree's
  * canonical encoding.
  *
  * <p>Tested code against: https://uva.onlinejudge.org/external/124/p12489.pdf

javatests/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphismTest.java

@@ -9,7 +9,6 @@
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.addUndirectedEdge;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.createGraph;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.treesAreIsomorphic;
-import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.TreeNode;
 
 import java.util.*;
 import org.junit.*;
@@ -135,7 +134,9 @@ public void testIsomorphismEquivilanceAgainstOtherImpl() {
         List<List<Integer>> tree2 = generateRandomTree(n);
 
         boolean impl1 = treesAreIsomorphic(tree1, tree2);
-        boolean impl2 = com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.treesAreIsomorphic(tree1, tree2);
+        boolean impl2 =
+            com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs
+                .treesAreIsomorphic(tree1, tree2);
         if (impl1 != impl2) {
           System.err.println("TreeIsomorphism algorithms disagree!");
           System.err.println(tree1);
@@ -148,29 +149,14 @@ public void testIsomorphismEquivilanceAgainstOtherImpl() {
 
   public static List<List<Integer>> generateRandomTree(int n) {
     List<Integer> nodes = new ArrayList<>();
-    nodes.add(0);    
+    nodes.add(0);
 
     List<List<Integer>> g = createGraph(n);
-    for(int nextNode = 1; nodes.size() != n; nextNode++) {
-      int randomNode = nodes.get((int)(Math.random() * nodes.size()));
+    for (int nextNode = 1; nodes.size() != n; nextNode++) {
+      int randomNode = nodes.get((int) (Math.random() * nodes.size()));
       addUndirectedEdge(g, randomNode, nextNode);
       nodes.add(nextNode);
     }
     return g;
   }
 }
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-

javatests/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeIsomorphismWithBfsTest.java

@@ -3,8 +3,8 @@
 import static com.google.common.truth.Truth.assertThat;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.addUndirectedEdge;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.createEmptyTree;
-import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.treesAreIsomorphic;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.encodeTree;
+import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.treesAreIsomorphic;
 
 import java.util.*;
 import org.junit.*;