Create bfs.py

Author: satriii

Graphs/Breadth First Search/bfs.py

@@ -0,0 +1,36 @@
+# Create a graph given in the above diagram.
+graph = {
+    'A': ['B', 'C', 'D'],
+    'B': ['A'],
+    'C': ['A', 'D'],
+    'D': ['A', 'C', 'E'],
+    'E': ['D']
+}
+
+# to print a BFS of a graph
+def bfs(node):
+
+    # mark vertices as False means not visited
+    visited = [False] * (len(graph))
+
+    # make a empty queue for bfs
+    queue = []
+
+    # mark given node as visited and add it to the queue
+    visited.append(node)
+    queue.append(node)
+
+    while queue:
+        # Remove the front vertex or the vertex at 0th index from the queue and print that vertex.
+        v = queue.pop(0)
+        print(v, end=" ")
+
+        for neigh in graph[v]:
+            if neigh not in visited:
+                visited.append(neigh)
+                queue.append(neigh)
+
+
+# Driver Code
+if __name__ == "__main__":
+    bfs('A')