CodeGlocks: breadth-first-search

pom.xml

@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0"
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+
+    <groupId>org.codeglocks</groupId>
+    <artifactId>java-algorithms</artifactId>
+    <version>1.0-SNAPSHOT</version>
+
+
+</project>

src/main/java/JavaAlgorithms.java

@@ -0,0 +1,5 @@
+public class JavaAlgorithms {
+    public static void main(String[] args) {
+
+    }
+}

src/main/java/breadthfirstsearch/BreadthFirstSearch.java

@@ -0,0 +1,82 @@
+package breadthfirstsearch;
+
+import java.util.Iterator;
+import java.util.LinkedList;
+
+public class BreadthFirstSearch {
+
+    static class Graph
+    {
+        private int V;   // No. of vertices
+        private LinkedList<Integer> adj[]; //Adjacency Lists
+
+        // Constructor
+        Graph(int v)
+        {
+            V = v;
+            adj = new LinkedList[v];
+            for (int i=0; i<v; ++i)
+                adj[i] = new LinkedList();
+        }
+
+        // Function to add an edge into the graph
+        void addEdge(int v,int w)
+        {
+            adj[v].add(w);
+        }
+
+        // prints BFS traversal from a given source s
+        void BFS(int s)
+        {
+            // Mark all the vertices as not visited(By default
+            // set as false)
+            boolean visited[] = new boolean[V];
+
+            // Create a queue for BFS
+            LinkedList<Integer> queue = new LinkedList<Integer>();
+
+            // Mark the current node as visited and enqueue it
+            visited[s]=true;
+            queue.add(s);
+
+            while (queue.size() != 0)
+            {
+                // Dequeue a vertex from queue and print it
+                s = queue.poll();
+                System.out.print(s+" ");
+
+                // Get all adjacent vertices of the dequeued vertex s
+                // If a adjacent has not been visited, then mark it
+                // visited and enqueue it
+                Iterator<Integer> i = adj[s].listIterator();
+                while (i.hasNext())
+                {
+                    int n = i.next();
+                    if (!visited[n])
+                    {
+                        visited[n] = true;
+                        queue.add(n);
+                    }
+                }
+            }
+        }
+    }
+
+    // Driver method to
+    public static void main(String args[])
+    {
+        Graph g = new Graph(4);
+
+        g.addEdge(0, 1);
+        g.addEdge(0, 2);
+        g.addEdge(1, 2);
+        g.addEdge(2, 0);
+        g.addEdge(2, 3);
+        g.addEdge(3, 3);
+
+        System.out.println("Following is Breadth First Traversal "+
+                "(starting from vertex 2)");
+
+        g.BFS(2);
+    }
+}