ff

Author: bm01wait

src/main/java/com/ctci/stacksandqueues/StackMinTest.java

@@ -1,8 +1,10 @@
 package main.java.com.ctci.stacksandqueues;
 
+import com.ctci.stacksandqueues.StackMin;
+
 public class StackMinTest {
     public static void main(String[] args) {
-        Result result = JUnitCore.runClasses(QueueViaStacks.class);
+        Result result = JUnitCore.runClasses(StackMin.class);
         for (Failure failure : result.getFailures()) {
             System.out.println(failure.toString());
         }

src/main/java/com/ctci/treesandgraphs/BuildOrder.java

@@ -8,7 +8,7 @@
 import java.util.Map;
 import java.util.Set;
 import java.util.stream.Stream;
-
+import org.junit.Assert.*;
 /**
  * You are given a list of projects and a list of dependencies (which is a list of pairs of projects, where the second
  * project is dependent on the first project). All of a project's dependencies must be built before the project is. Find
@@ -107,7 +107,7 @@ private void removeDependency(Set<Project> newlyBuiltProjects) {
         projects.forEach((n, p) -> p.dependencies.removeAll(newlyBuiltProjects));
     }
 
-
+    @Test
     public static void main(String[] args) {
         /* test case 1
         
@@ -139,6 +139,8 @@ public static void main(String[] args) {
         buildOrder.addDependency("b", "a");
         buildOrder.addDependency("b", "e");
         buildOrder.addDependency("a", "e");
+        assertNull(buildOrder);
         System.out.println(buildOrder.getBuildOrder());
+        
     }
 }

src/main/java/com/ctci/treesandgraphs/BuildOrderTest.java

@@ -0,0 +1,13 @@
+package main.java.com.ctci.treesandgraphs;
+
+import com.ctci.treesandgraphs.BuildOrder;
+
+public class BuildOrderTest {
+    public static void main(String[] args) {
+        Result result = JUnitCore.runClasses(BuildOrder.class);
+        for (Failure failure : result.getFailures()) {
+            System.out.println(failure.toString());
+        }
+        System.out.println("Result == "+result.wasSuccessful());
+    } 
+}