graphs algo directory with dfs

acmbvp · Oct 22, 2017 · ec1643a · ec1643a
1 parent b328aac
commit ec1643a
Show file tree

Hide file tree

Showing 19 changed files with 55 additions and 0 deletions.
diff --git a/BFS/c++/bfs.cpp b/BFS/c++/bfs.cpp
diff --git a/DP/Coin Change Problem/MinCoins.cpp b/DP/Coin Change Problem/MinCoins.cpp
diff --git a/DP/Coin Change Problem/NoOfWays.cpp b/DP/Coin Change Problem/NoOfWays.cpp
diff --git a/Math/gcd/gcd.cpp b/Math/gcd/gcd.cpp
diff --git a/Math/max_divisible_num/max_divisible_num.cpp b/Math/max_divisible_num/max_divisible_num.cpp
diff --git a/README.md b/README.md
diff --git a/Search/BinarySearch/README.md b/Search/BinarySearch/README.md
diff --git a/Sorting/CountingSort.java b/Sorting/CountingSort.java
diff --git a/Sorting/Heapsort.py b/Sorting/Heapsort.py
diff --git a/Sorting/InsertionSort.java b/Sorting/InsertionSort.java
diff --git a/Sorting/InsertionSort.py b/Sorting/InsertionSort.py
diff --git a/Sorting/Insertion_Sort_with_Binary_Search.cpp b/Sorting/Insertion_Sort_with_Binary_Search.cpp
diff --git a/Sorting/MergeSort.java b/Sorting/MergeSort.java
diff --git a/Sorting/MergeSort.py b/Sorting/MergeSort.py
diff --git a/Sorting/QuickSort.py b/Sorting/QuickSort.py
diff --git a/Sorting/RadixSort.java b/Sorting/RadixSort.java
diff --git a/Sorting/quick_sort.java b/Sorting/quick_sort.java
diff --git a/Sorting/selectionsort.cpp b/Sorting/selectionsort.cpp
diff --git a/graph/depthfirstsearch.py b/graph/depthfirstsearch.py
@@ -0,0 +1,55 @@
+# Python program to print DFS traversal from a
+# given given graph
+from collections import defaultdict
+
+# This class represents a directed graph using
+# adjacency list representation
+class Graph:
+
+    # Constructor
+    def __init__(self):
+
+        # default dictionary to store graph
+        self.graph = defaultdict(list)
+
+    # function to add an edge to graph
+    def addEdge(self,u,v):
+        self.graph[u].append(v)
+
+    # A function used by DFS
+    def DFSUtil(self,v,visited):
+
+        # Mark the current node as visited and print it
+        visited[v]= True
+        print v,
+
+        # Recur for all the vertices adjacent to this vertex
+        for i in self.graph[v]:
+            if visited[i] == False:
+                self.DFSUtil(i, visited)
+
+
+    # The function to do DFS traversal. It uses
+    # recursive DFSUtil()
+    def DFS(self,v):
+
+        # Mark all the vertices as not visited
+        visited = [False]*(len(self.graph))
+
+        # Call the recursive helper function to print
+        # DFS traversal
+        self.DFSUtil(v,visited)
+
+
+# Driver code
+# Create a graph given in the above diagram
+g = Graph()
+g.addEdge(0, 1)
+g.addEdge(0, 2)
+g.addEdge(1, 2)
+g.addEdge(2, 0)
+g.addEdge(2, 3)
+g.addEdge(3, 3)
+
+print "Following is DFS from (starting from vertex 2)"
+g.DFS(2)