Add algorithm to find center node(s)

williamfiset · williamfiset · commit f7fecc640cb7 · 2020-02-02T16:53:44.000-08:00
diff --git a/src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java b/src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java
@@ -5,10 +5,12 @@
  *
  * <p>Download the code: $ git clone https://github.com/williamfiset/Algorithms
  *
- * <p>Change directory to the root of the Algorithms directory: 
- * <p> $ cd Algorithms
+ * <p>Change directory to the root of the Algorithms directory:
  *
- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java
+ * <p>$ cd Algorithms
+ *
+ * <p>Build: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java
  *
  * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/dp/examples/HouseRobber
  */
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java b/src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java
@@ -6,9 +6,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java
+ * <p>Compile: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample
  *
  * <p>Time Complexity: O(ElogV)
  *
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java b/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java
@@ -9,9 +9,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Build: $ javac src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java
+ * <p>Build: $ javac
+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java
  *
- * <p>Run: $ java -cp src/main/java/ com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample
+ * <p>Run: $ java -cp src/main/java/
+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample
  */
 package com.williamfiset.algorithms.graphtheory.networkflow.examples;
 
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java b/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java
@@ -8,9 +8,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java
+ * <p>Build: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample
  */
 package com.williamfiset.algorithms.graphtheory.networkflow.examples;
 
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java b/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java
@@ -7,9 +7,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java
+ * <p>Build: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample
  */
 package com.williamfiset.algorithms.graphtheory.networkflow.examples;
 
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java b/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java
@@ -8,9 +8,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Build: $ javac  -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java
+ * <p>Build: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/FordFulkersonExample
  */
 package com.williamfiset.algorithms.graphtheory.networkflow.examples;
 
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java b/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java
@@ -3,9 +3,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Build: $ javac  -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java
+ * <p>Build: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls
  */
 package com.williamfiset.algorithms.graphtheory.networkflow.examples;
 
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java b/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImpl.java
@@ -14,7 +14,8 @@
 
 public class TreeCenterLongestPathImpl {
 
-  private static int[] dfs(List<List<Integer>> graph, boolean[] visited, int[] prev, int at, int parent) {
+  private static int[] dfs(
+      List<List<Integer>> graph, boolean[] visited, int[] prev, int at, int parent) {
 
     // Already visited this node
     if (visited[at]) return new int[] {0, parent};
@@ -40,7 +41,7 @@ private static int[] dfs(List<List<Integer>> graph, boolean[] visited, int[] pre
     return new int[] {bestDist, index};
   }
 
-  public static List<Integer> treeCenter(List<List<Integer>> graph) {
+  public static List<Integer> findTreeCenters(List<List<Integer>> graph) {
     List<Integer> centers = new ArrayList<>();
     if (graph == null) return centers;
 
@@ -68,13 +69,13 @@ public static List<Integer> treeCenter(List<List<Integer>> graph) {
     }
 
     if (path.size() % 2 == 0) {
-      centers.add(path.get(path.size()/2-1));
+      centers.add(path.get(path.size() / 2 - 1));
     }
-    centers.add(path.get(path.size()/2));
+    centers.add(path.get(path.size() / 2));
     return centers;
   }
 
-    /** ********** TESTING ********* */
+  /** ********** TESTING ********* */
 
   // Create an empty tree as a adjacency list.
   public static List<List<Integer>> createEmptyTree(int n) {
@@ -101,29 +102,29 @@ public static void main(String[] args) {
     addUndirectedEdge(graph, 6, 8);
 
     // Centers are 2
-    System.out.println(treeCenter(graph)+"\n");
+    System.out.println(findTreeCenters(graph) + "\n");
 
     // Centers are 0
     List<List<Integer>> graph2 = createEmptyTree(1);
-    System.out.println(treeCenter(graph2)+"\n");
+    System.out.println(findTreeCenters(graph2) + "\n");
 
     // Centers are 0,1
     List<List<Integer>> graph3 = createEmptyTree(2);
     addUndirectedEdge(graph3, 0, 1);
-    System.out.println(treeCenter(graph3)+"\n");
+    System.out.println(findTreeCenters(graph3) + "\n");
 
     // Centers are 1
     List<List<Integer>> graph4 = createEmptyTree(3);
     addUndirectedEdge(graph4, 0, 1);
     addUndirectedEdge(graph4, 1, 2);
-    System.out.println(treeCenter(graph4)+"\n");
+    System.out.println(findTreeCenters(graph4) + "\n");
 
     // 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(treeCenter(graph5)+"\n");
+    System.out.println(findTreeCenters(graph5) + "\n");
 
     // Centers are 2,3
     List<List<Integer>> graph6 = createEmptyTree(7);
@@ -133,6 +134,6 @@ public static void main(String[] args) {
     addUndirectedEdge(graph6, 3, 4);
     addUndirectedEdge(graph6, 4, 5);
     addUndirectedEdge(graph6, 4, 6);
-    System.out.println(treeCenter(graph6)+"\n");
+    System.out.println(findTreeCenters(graph6) + "\n");
   }
 }
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java b/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java
@@ -5,9 +5,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java
+ * <p>Compile: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight
  *
  * <p>Time Complexity: O(n)
  *
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum.java b/src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum.java
@@ -5,9 +5,11 @@
  *
  * <p>Change directory to the root of the Algorithms directory: $ cd Algorithms
  *
- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum.java
+ * <p>Compile: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum.java
  *
- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum
+ * <p>Run: $ java -cp src/main/java
+ * com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeSum
  *
  * <p>Time Complexity: O(n)
  *
diff --git a/src/main/java/com/williamfiset/algorithms/math/CompressedPrimeSieve.java b/src/main/java/com/williamfiset/algorithms/math/CompressedPrimeSieve.java
@@ -7,7 +7,8 @@
  *
  * <p>Time Complexity: ~O(nloglogn)
  *
- * <p>Compile: javac -d src/main/java src/main/java/com/williamfiset/algorithms/math/CompressedPrimeSieve.java
+ * <p>Compile: javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/math/CompressedPrimeSieve.java
  *
  * <p>Run: java -cp src/main/java com/williamfiset/algorithms/math/CompressedPrimeSieve
  *
diff --git a/src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java b/src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java
@@ -5,7 +5,8 @@
  *
  * <p>Run on command line:
  *
- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java
+ * <p>Compile: $ javac -d src/main/java
+ * src/main/java/com/williamfiset/algorithms/strings/LongestCommonSubstring.java
  *
  * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/strings/LongestCommonSubstring
  *
diff --git a/src/test/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImplTest.java b/src/test/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterLongestPathImplTest.java
@@ -0,0 +1,72 @@
+// To run this test in isolation from root folder:
+//
+// $ gradle test --tests
+// com.williamfiset.algorithms.graphtheory.treealgorithms.TreeCenterLongestPathImplTest
+
+package com.williamfiset.algorithms.graphtheory.treealgorithms;
+
+import static com.google.common.truth.Truth.assertThat;
+import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeCenterLongestPathImpl.addUndirectedEdge;
+import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeCenterLongestPathImpl.createEmptyTree;
+import static com.williamfiset.algorithms.graphtheory.treealgorithms.TreeCenterLongestPathImpl.findTreeCenters;
+
+import java.util.*;
+import org.junit.*;
+
+public class TreeCenterLongestPathImplTest {
+
+  @Test
+  public void simpleTest1() {
+    List<List<Integer>> graph = createEmptyTree(9);
+    addUndirectedEdge(graph, 0, 1);
+    addUndirectedEdge(graph, 2, 1);
+    addUndirectedEdge(graph, 2, 3);
+    addUndirectedEdge(graph, 3, 4);
+    addUndirectedEdge(graph, 5, 3);
+    addUndirectedEdge(graph, 2, 6);
+    addUndirectedEdge(graph, 6, 7);
+    addUndirectedEdge(graph, 6, 8);
+    assertThat(findTreeCenters(graph)).containsExactly(2);
+  }
+
+  @Test
+  public void singleton() {
+    assertThat(findTreeCenters(createEmptyTree(1))).containsExactly(0);
+  }
+
+  @Test
+  public void twoNodeTree() {
+    List<List<Integer>> graph = createEmptyTree(2);
+    addUndirectedEdge(graph, 0, 1);
+    assertThat(findTreeCenters(graph)).containsExactly(0, 1);
+  }
+
+  @Test
+  public void simpleTest2() {
+    List<List<Integer>> graph = createEmptyTree(3);
+    addUndirectedEdge(graph, 0, 1);
+    addUndirectedEdge(graph, 1, 2);
+    assertThat(findTreeCenters(graph)).containsExactly(1);
+  }
+
+  @Test
+  public void simpleTest3() {
+    List<List<Integer>> graph = createEmptyTree(4);
+    addUndirectedEdge(graph, 0, 1);
+    addUndirectedEdge(graph, 1, 2);
+    addUndirectedEdge(graph, 2, 3);
+    assertThat(findTreeCenters(graph)).containsExactly(1, 2);
+  }
+
+  @Test
+  public void simpleTest4() {
+    List<List<Integer>> graph = createEmptyTree(7);
+    addUndirectedEdge(graph, 0, 1);
+    addUndirectedEdge(graph, 1, 2);
+    addUndirectedEdge(graph, 2, 3);
+    addUndirectedEdge(graph, 3, 4);
+    addUndirectedEdge(graph, 4, 5);
+    addUndirectedEdge(graph, 4, 6);
+    assertThat(findTreeCenters(graph)).containsExactly(2, 3);
+  }
+}
diff --git a/src/test/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterTest.java b/src/test/java/com/williamfiset/algorithms/graphtheory/treealgorithms/TreeCenterTest.java
@@ -15,11 +15,6 @@
 
 public class TreeCenterTest {
 
-  @Test
-  public void emptyTreeThrowsException() {
-    assertThat(createEmptyTree(0)).isEmpty();
-  }
-
   @Test
   public void simpleTest1() {
     List<List<Integer>> graph = createEmptyTree(9);
@@ -74,4 +69,33 @@ public void simpleTest4() {
     addUndirectedEdge(graph, 4, 6);
     assertThat(findTreeCenters(graph)).containsExactly(2, 3);
   }
+
+  @Test
+  public void testTreeCenterVsOtherImpl() {
+    for (int n = 1; n < 500; n++) {
+      for (int loops = 0; loops < 100; loops++) {
+        List<List<Integer>> tree = generateRandomTree(n);
+
+        List<Integer> impl1 = findTreeCenters(tree);
+        List<Integer> impl2 =
+            com.williamfiset.algorithms.graphtheory.treealgorithms.TreeCenterLongestPathImpl
+                .findTreeCenters(tree);
+
+        assertThat(impl1).containsExactlyElementsIn(impl2);
+      }
+    }
+  }
+
+  public static List<List<Integer>> generateRandomTree(int n) {
+    List<Integer> nodes = new ArrayList<>();
+    nodes.add(0);
+
+    List<List<Integer>> g = createEmptyTree(n);
+    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;
+  }
 }

Original file line number	Diff line number	Diff line change
`@@ -5,10 +5,12 @@`
`5`	`5`	`*`
`6`	`6`	`* <p>Download the code: $ git clone https://github.com/williamfiset/Algorithms`
`7`	`7`	`*`
`8`		`- * <p>Change directory to the root of the Algorithms directory:`
`9`		`- * <p> $ cd Algorithms`
	`8`	`+ * <p>Change directory to the root of the Algorithms directory:`
`10`	`9`	`*`
`11`		`- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java`
	`10`	`+ * <p>$ cd Algorithms`
	`11`	`+ *`
	`12`	`+ * <p>Build: $ javac -d src/main/java`
	`13`	`+ * src/main/java/com/williamfiset/algorithms/dp/examples/HouseRobber.java`
`12`	`14`	`*`
`13`	`15`	`* <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/dp/examples/HouseRobber`
`14`	`16`	`*/`
Original file line number	Diff line number	Diff line change
`@@ -6,9 +6,11 @@`
`6`	`6`	`*`
`7`	`7`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`8`	`8`	`*`
`9`		`- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java`
	`9`	`+ * <p>Compile: $ javac -d src/main/java`
	`10`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample.java`
`10`	`11`	`*`
`11`		`- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample`
	`12`	`+ * <p>Run: $ java -cp src/main/java`
	`13`	`+ * com/williamfiset/algorithms/graphtheory/examples/EagerPrimsExample`
`12`	`14`	`*`
`13`	`15`	`* <p>Time Complexity: O(ElogV)`
`14`	`16`	`*`
Original file line number	Diff line number	Diff line change
`@@ -9,9 +9,11 @@`
`9`	`9`	`*`
`10`	`10`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`11`	`11`	`*`
`12`		`- * <p>Build: $ javac src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java`
	`12`	`+ * <p>Build: $ javac`
	`13`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample.java`
`13`	`14`	`*`
`14`		`- * <p>Run: $ java -cp src/main/java/ com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample`
	`15`	`+ * <p>Run: $ java -cp src/main/java/`
	`16`	`+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/CapacityScalingExample`
`15`	`17`	`*/`
`16`	`18`	`package com.williamfiset.algorithms.graphtheory.networkflow.examples;`
`17`	`19`
Original file line number	Diff line number	Diff line change
`@@ -8,9 +8,11 @@`
`8`	`8`	`*`
`9`	`9`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`10`	`10`	`*`
`11`		`- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java`
	`11`	`+ * <p>Build: $ javac -d src/main/java`
	`12`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample.java`
`12`	`13`	`*`
`13`		`- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample`
	`14`	`+ * <p>Run: $ java -cp src/main/java`
	`15`	`+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/DinicsExample`
`14`	`16`	`*/`
`15`	`17`	`package com.williamfiset.algorithms.graphtheory.networkflow.examples;`
`16`	`18`
Original file line number	Diff line number	Diff line change
`@@ -7,9 +7,11 @@`
`7`	`7`	`*`
`8`	`8`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`9`	`9`	`*`
`10`		`- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java`
	`10`	`+ * <p>Build: $ javac -d src/main/java`
	`11`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample.java`
`11`	`12`	`*`
`12`		`- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample`
	`13`	`+ * <p>Run: $ java -cp src/main/java`
	`14`	`+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/EdmondsKarpExample`
`13`	`15`	`*/`
`14`	`16`	`package com.williamfiset.algorithms.graphtheory.networkflow.examples;`
`15`	`17`
Original file line number	Diff line number	Diff line change
`@@ -3,9 +3,11 @@`
`3`	`3`	`*`
`4`	`4`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`5`	`5`	`*`
`6`		`- * <p>Build: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java`
	`6`	`+ * <p>Build: $ javac -d src/main/java`
	`7`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls.java`
`7`	`8`	`*`
`8`		`- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls`
	`9`	`+ * <p>Run: $ java -cp src/main/java`
	`10`	`+ * com/williamfiset/algorithms/graphtheory/networkflow/examples/MiceAndOwls`
`9`	`11`	`*/`
`10`	`12`	`package com.williamfiset.algorithms.graphtheory.networkflow.examples;`
`11`	`13`
Original file line number	Diff line number	Diff line change
`@@ -5,9 +5,11 @@`
`5`	`5`	`*`
`6`	`6`	`* <p>Change directory to the root of the Algorithms directory: $ cd Algorithms`
`7`	`7`	`*`
`8`		`- * <p>Compile: $ javac -d src/main/java src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java`
	`8`	`+ * <p>Compile: $ javac -d src/main/java`
	`9`	`+ * src/main/java/com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight.java`
`9`	`10`	`*`
`10`		`- * <p>Run: $ java -cp src/main/java com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight`
	`11`	`+ * <p>Run: $ java -cp src/main/java`
	`12`	`+ * com/williamfiset/algorithms/graphtheory/treealgorithms/examples/TreeHeight`
`11`	`13`	`*`
`12`	`14`	`* <p>Time Complexity: O(n)`
`13`	`15`	`*`