Removed redundant BFS vertices

rasmus4200 · Dec 24, 2020 · be62f0d · be62f0d
1 parent 22c61e0
commit be62f0d
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 13 deletions.
diff --git a/src/main/java/algorithms/graphs/BFS/Graph.java b/src/main/java/algorithms/graphs/BFS/Graph.java
@@ -28,14 +28,12 @@ void BFS(int s) {
 
         // Mark the current node as visited and enqueue it
         visited[s] = true;
-        System.out.println("Starting at " + s);
+        System.out.println("n " + s);
         queue.add(s);
 
         while (queue.size() != 0) {
             // Dequeue a vertex from queue and print it
             s = queue.poll();
-            System.out.println("De-queueing " + s);
-//            System.out.print(s + " ");
 
             // Get all adjacent vertices of the de-queued vertex s
             // If a adjacent has not been visited, then mark it
@@ -45,7 +43,7 @@ void BFS(int s) {
                 int n = i.next();
                 if (!visited[n]) {
                     visited[n] = true;
-                    System.out.println("Queueing " + n);
+                    System.out.println("n " + n);
                     queue.add(n);
                 }
             }

diff --git a/src/test/java/algorithms/graphs/BFS/GraphTest.java b/src/test/java/algorithms/graphs/BFS/GraphTest.java
@@ -17,23 +17,14 @@ public void SetUp() {
     public void BreadFirstSearch() {
 
         g.addEdge(0, 1);
-        g.addEdge(1, 0);
         g.addEdge(1, 4);
-        g.addEdge(4, 1);
         g.addEdge(4, 6);
-        g.addEdge(6, 4);
         g.addEdge(6, 0);
-        g.addEdge(0, 6);
         g.addEdge(1, 5);
-        g.addEdge(5, 1);
         g.addEdge(5, 3);
-        g.addEdge(3, 5);
         g.addEdge(3, 0);
-        g.addEdge(0, 3);
         g.addEdge(5, 2);
-        g.addEdge(2, 5);
         g.addEdge(2, 7);
-        g.addEdge(7, 2);
 
         System.out.println("Following is Breadth First Traversal "+
                 "(starting from vertex 0)");