Use deque as queue in breadth_first_search_shortest_path_2.py

graphs/breadth_first_search_shortest_path_2.py

@@ -90,7 +90,7 @@ def bfs_shortest_path_distance(graph: dict, start, target) -> int:
         return -1
     if start == target:
         return 0
-    queue = deque(start)
+    queue = deque([start])
     visited = set(start)
     # Keep tab on distances from `start` node.
     dist = {start: 0, target: -1}