Merge pull request codemistic#477 from rohansrivastava5491/patch-3

Added depth first search in python

Author: gantavyamalviya

Python/Searching-Algorithms/Depth_first_search.py

@@ -0,0 +1,22 @@
+# 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
+print("Following is the Depth-First Search")
+dfs(visited, graph, '5')