Update bfs_exercise_solution.py

nikhilailani · web-flow · commit 699382b9ccb6 · 2020-12-24T15:23:45.000+05:30
diff --git a/algorithms/9_BreadthFirstSearch/bfs_exercise_solution.py b/algorithms/9_BreadthFirstSearch/bfs_exercise_solution.py
@@ -5,7 +5,7 @@ def bfs(data, start, end, visited=[]):
         current_node = queue.pop(0)
         if current_node==end:
             print("Path exists!")
-            print("Path : " + "->".join(visited) + "->"+end)
+            print("Path: " + "->".join(visited) + "->" + end)
             return
         visited.append(current_node)
         
