added test code for graph operations

Author: NirmalSilwal

Interview Prep/section20_Graph/GraphClient.java

@@ -27,39 +27,95 @@ public static void main(String[] args) {
 
 		graph.dispaly();
 
+		/* test 1 */
+
 		// System.out.println(graph.containsVertex("D"));
 		// System.out.println(graph.containsVertex("P"));
-		//
+
 		// System.out.println(graph.numVertex());
 		// System.out.println(graph.numEdges());
 		//
 		// System.out.println(graph.containsEdge("A", "D"));
 		// System.out.println(graph.containsEdge("C", "D"));
 		// System.out.println(graph.containsEdge("C", "G"));
-		//
+
 		// System.out.println("\nbefore: " + graph.numEdges());
 		// graph.removeEdge("E", "F");
 		// System.out.println("after: " + graph.numEdges());
-		//
+
 		// graph.dispaly();
-		//
+
+		/* test 2 */
+
 		// graph.addEdge("C", "F", 2);
 		// graph.dispaly();
-		//
+
 		// System.out.println("before: " + graph.numVertex());
 		// graph.removeVertex("F");
 		// System.out.println("after: " + graph.numVertex());
 		// graph.dispaly();
 
-		System.out.println("tesing hasPath() method..");
-		HashMap<String, Boolean> processed = new HashMap<>();
-		System.out.println(graph.hasPath("A", "F", processed));
+		/* test 3 */
+
+		// System.out.println("tesing hasPath() method..");
+		// HashMap<String, Boolean> processed = new HashMap<>();
+		// System.out.println(graph.hasPath("A", "F", processed));
+
+		// System.out.println(graph.hasPath("A", "E", new HashMap<String,
+		// Boolean>()));
+		// System.out.println(graph.hasPath("A", "G", new HashMap<String,
+		// Boolean>()));
+		// System.out.println(graph.hasPath("G", "C", new HashMap<String,
+		// Boolean>()));
+		// graph.removeEdge("D", "E");
+		// System.out.println(graph.hasPath("B", "F", new HashMap<String,
+		// Boolean>()));
+
+		/* test 4 */
+
+		// System.out.println("\ntesting Breadth First Search...\n");
+		// System.out.println(graph.bfs("A", "F")); // ADEF true
+
+		// // break the edge between D and E
+		// // graph.removeEdge("D", "E");
+		// // System.out.println(graph.bfs("A", "F")); // false
+
+		// // break the edge between A and D
+		// graph.removeEdge("A", "D");
+		// System.out.println(graph.bfs("A", "F")); // ABCDEF true
+
+		/* test 5 */
+
+		// System.out.println("\ntesting Depth First Search...");
+		// // System.out.println(graph.dfs("A", "F")); // ADEF true
+
+		// // test by replacing vertex name B to H in the Graph
+		// System.out.println(graph.dfs("A", "F")); // AHCDEF true
+
+		// /* test 6 */
+
+		// System.out.println("breadth first traversal...");
+		// graph.breadthFirstTraversal();
+		// System.out.println("\nremoving edge between D & E vertex and doing
+		// bft");
+		// graph.removeEdge("D", "E");
+		// graph.breadthFirstTraversal();
+
+		/* test 7 */
+
+		// System.out.println("depth first traversal...");
+		// graph.depthFirstTraversal();
+		// System.out.println("\nremoving edge between D & E vertex and doing
+		// dft");
+		// graph.removeEdge("D", "E");
+		// graph.depthFirstTraversal();
 
-		System.out.println(graph.hasPath("A", "E", new HashMap<String, Boolean>()));
-		System.out.println(graph.hasPath("A", "G", new HashMap<String, Boolean>()));
-		System.out.println(graph.hasPath("G", "C", new HashMap<String, Boolean>()));
-		graph.removeEdge("D", "E");
-		System.out.println(graph.hasPath("B", "F", new HashMap<String, Boolean>()));
+		/* test 8 */
+		System.out.println("cyclic: " + graph.isCyclic()); // true
+		graph.removeEdge("C", "D");
+		System.out.println("cyclic: " + graph.isCyclic()); // true
+		graph.removeEdge("F", "G");
+		System.out.println("cyclic: " + graph.isCyclic()); // false
 
 	}
 }