Add files via upload

SagarKumar04 · web-flow · commit edaf771cb1a8 · 2021-08-12T23:04:21.000+05:30
diff --git a/Graph/BFS.java b/Graph/BFS.java
@@ -0,0 +1,53 @@
+package InfinityJune21.Graph;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+import java.util.LinkedList;
+
+public class BFS {
+    static ArrayList<ArrayList<Integer>> adjacencyList = new ArrayList<ArrayList<Integer>>();
+    static void bfs(int source, int V) {
+        boolean visited[] = new boolean[V];
+        LinkedList<Integer> queue = new LinkedList<>();
+
+        visited[source] = true;
+        queue.add(source);
+
+        while(queue.size() != 0) {
+            //Deque
+            source = queue.poll();
+            System.out.print(source + " ");
+
+            ArrayList<Integer> neighbours = adjacencyList.get(source);
+            for(Integer neighbour : neighbours) {
+                if(!visited[neighbour]) {
+                    visited[neighbour] = true;
+                    queue.add(neighbour);
+                }
+            }
+        }
+    }
+
+    static void addEdge(ArrayList<ArrayList<Integer>> adjacencyList, int u, int v) {
+        adjacencyList.get(u).add(v);
+        adjacencyList.get(v).add(u);
+    }
+
+    public static void main(String[] args) {
+        int V = 5;
+
+        for(int i = 0; i < V; i++) {
+            adjacencyList.add(new ArrayList<Integer>());
+        }
+
+        addEdge(adjacencyList, 0, 1);
+        addEdge(adjacencyList, 0, 4);
+        addEdge(adjacencyList, 1, 2);
+        addEdge(adjacencyList, 1, 3);
+        addEdge(adjacencyList, 1, 4);
+        addEdge(adjacencyList, 2, 3);
+        addEdge(adjacencyList, 3, 4);
+
+        bfs(0, V);
+    }
+}
diff --git a/Graph/DFS.java b/Graph/DFS.java
@@ -0,0 +1,46 @@
+package InfinityJune21.Graph;
+
+import java.util.ArrayList;
+
+public class DFS {
+    static int V = 5;
+    static ArrayList<ArrayList<Integer>> adjacencyList = new ArrayList<ArrayList<Integer>>();
+
+    static void addEdge(ArrayList<ArrayList<Integer>> adjacencyList, int u, int v) {
+        adjacencyList.get(u).add(v);
+        adjacencyList.get(v).add(u);
+    }
+
+    static void dfs(int source) {
+        boolean visited[] = new boolean[V];
+        dfsUtility(source, visited);
+    }
+
+    static void dfsUtility(int source, boolean visited[]) {
+        visited[source] = true;
+        System.out.print(source + " ");
+
+        ArrayList<Integer> adjacent = adjacencyList.get(source);
+        for(Integer adj : adjacent) {
+            if(!visited[adj]) {
+                dfsUtility(adj, visited);
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        for(int i = 0; i < V; i++) {
+            adjacencyList.add(new ArrayList<Integer>());
+        }
+
+        addEdge(adjacencyList, 0, 1);
+        addEdge(adjacencyList, 0, 4);
+        addEdge(adjacencyList, 1, 2);
+        addEdge(adjacencyList, 1, 3);
+        addEdge(adjacencyList, 1, 4);
+        addEdge(adjacencyList, 2, 3);
+        addEdge(adjacencyList, 3, 4);
+
+        dfs(0);
+    }
+}
diff --git a/Graph/Insertion.java b/Graph/Insertion.java
@@ -3,6 +3,25 @@
 import java.util.ArrayList;
 
 public class Insertion {
+    static void printGraph(ArrayList<ArrayList<Integer>> adjacencyList) {
+        System.out.println("List is:");
+        System.out.println(adjacencyList);
+
+        for(int i = 0; i < adjacencyList.size(); i++) {
+            System.out.println("List at vertex " + i + ": ");
+            System.out.print(i);
+            for(int j = 0; j < adjacencyList.get(i).size(); j++) {
+                System.out.print("->" + adjacencyList.get(i).get(j));
+            }
+            System.out.println();
+        }
+    }
+
+    static void addEdge(ArrayList<ArrayList<Integer>> adjacencyList, int u, int v) {
+        adjacencyList.get(u).add(v);
+        adjacencyList.get(v).add(u);
+    }
+
     public static void main(String[] args) {
         int V = 5;
 
@@ -11,5 +30,15 @@ public static void main(String[] args) {
         for(int i = 0; i < V; i++) {
             adjacencyList.add(new ArrayList<Integer>());
         }
+
+        addEdge(adjacencyList, 0, 1);
+        addEdge(adjacencyList, 0, 4);
+        addEdge(adjacencyList, 1, 2);
+        addEdge(adjacencyList, 1, 3);
+        addEdge(adjacencyList, 1, 4);
+        addEdge(adjacencyList, 2, 3);
+        addEdge(adjacencyList, 3, 4);
+
+        printGraph(adjacencyList);
     }
 }
