Depth First Search

Author: Shikha-code36

Graphs/dfs.py

@@ -0,0 +1,27 @@
+# Using a Python dictionary to act as an adjacency list
+graph = {
+  '5' : ['3','7'],
+  '3' : ['2', '4'],
+  '7' : ['8'],
+  '2' : [],
+  '4' : ['8'],
+  '8' : []
+}
+
+visited = set() # Set to keep track of visited nodes of graph.
+
+def dfs(visited, graph, node):  #function for dfs 
+    if node not in visited:
+        print (node)
+        visited.add(node)
+        for neighbour in graph[node]:
+            dfs(visited, graph, neighbour)
+
+# Driver Code
+dfs(visited, graph, '5')
+# 5
+# 3
+# 2
+# 4
+# 8
+# 7

README.md

@@ -17,4 +17,5 @@ Data Structures and Algorithms Patterns implemented in Python.
     - [x] [Recursion on Linked List](Recursion/Linked-List)
         - [x] [Reverse Linked List](Recursion/Linked-List/Reverse-Linked-List.py)
 - [x] [Graphs](Graphs)
-    - [x] [Breadth First Search](Graphs/bfs.py)
+    - [x] [Breadth First Search](Graphs/bfs.py)
+    - [x] [Depth First Search](Graphs/dfs.py)