Tree isomorphism tests

Author: williamfiset

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

@@ -143,7 +143,7 @@ public static String encode(TreeNode node) {
     return "(" + sb.toString() + ")";
   }
 
-    /* Graph/Tree creation helper methods. */
+  /* Graph/Tree creation helper methods. */
 
   // Create a graph as a adjacency list
   public static List<List<Integer>> createGraph(int n) {
@@ -157,7 +157,7 @@ public static void addUndirectedEdge(List<List<Integer>> graph, int from, int to
     graph.get(to).add(from);
   }
 
-    /* Example usage */
+  /* Example usage */
 
   public static void main(String[] args) {
     simpleIsomorphismTest();
@@ -199,7 +199,8 @@ private static void testEncodingTreeFromSlides() {
 
     TreeNode root0 = rootTree(tree, 0);
 
-    System.out.println("Tree from slides encoding:");
-    System.out.println(encode(root0));
+    if (!encode(root0).equals("(((())())(()())(()))")) {
+      System.out.println("Tree encoding is wrong: " + encode(root0));
+    }
   }
 }

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

@@ -6,11 +6,11 @@
 package javatests.com.williamfiset.algorithms.graphtheory.treealgorithms;
 
 import static com.google.common.truth.Truth.assertThat;
+import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.TreeNode;
 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.encodeTree;
 import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphismWithBfs.treesAreIsomorphic;
-import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.TreeNode;
 
 import java.util.*;
 import org.junit.*;
@@ -147,37 +147,30 @@ public void t() {
     node2.addChildren(node6, node7);
     node3.addChildren(node8);
 
-    System.out.println(com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.encode(node0));
-    
+    // TODO(william): finish this test to check for "(((())())(()())(()))" encoding
+    // System.out.println(
+    // com.williamfiset.algorithms.graphtheory.treealgorithms.TreeIsomorphism.encode(node0));
+
     // (((())())(()())(()))
-    //  ((())())               
+    //  ((())())
     //          (()())
     //                (())
-    //             
+    //
 
     // (()())
     // (())
     // (())
 
     // ((()())(()))
     // ((())())
-    // 
+    //
     // ((()())(()))((())())
 
-
     // (((()())(()))((())()))
     //   (()())
     //         (())
-    //      
+    //
     //             ((())())
     //
   }
 }
-
-
-
-
-
-
-
-