diff --git a/Traversal Algorithms/Graph Traversals/BFS/Python/BFS.py b/Traversal Algorithms/Graph Traversals/BFS/Python/BFS.py
new file mode 100644
index 0000000..a6c6d4d
--- /dev/null
+++ b/Traversal Algorithms/Graph Traversals/BFS/Python/BFS.py	
@@ -0,0 +1,29 @@
+import queue
+
+
+graph = {
+  '5' : ['3','7'],
+  '3' : ['2', '4'],
+  '7' : ['8'],
+  '2' : [],
+  '4' : ['8'],
+  '8' : []
+}
+visited=[]
+queue=[]
+
+def bfs(visited,graph,node):
+  
+    visited.append(node)
+    queue.append(node)
+
+    while queue:
+      m=queue.pop(0)
+      print(m , end=" ")
+
+      for i in graph[m]:
+          if i not in visited:
+              visited.append(i)
+              queue.append(i)
+
+bfs(visited,graph,'5')