Create BreadtFirstSearch_2.py

Author: ybenchekroun

Graphs/BreadtFirstSearch_2.py

@@ -0,0 +1,31 @@
+# From https://www.educative.io/edpresso/how-to-implement-a-breadth-first-search-in-python
+
+def bfs(graph, node):
+  visited = []   # List to keep track of visited nodes.
+  queue = []     #Initialize a queue
+
+  visited.append(node)
+  queue.append(node)
+
+  while queue:
+    s = queue.pop(0) 
+    print(s, end = " ") 
+
+    for neighbour in graph[s]:
+      if neighbour not in visited:
+        visited.append(neighbour)
+        queue.append(neighbour)
+        
+
+# Driver Code
+
+graph = {
+  'A' : ['B','C'],
+  'B' : ['D', 'E'],
+  'C' : ['F'],
+  'D' : [],
+  'E' : ['F'],
+  'F' : []
+}
+
+bfs(graph, 'C')