xxxxxxxxxx
from collections import deque
def does_path_exist_bfs(graph, start, end):
visited = set()
queue = deque([start])
while queue:
current = queue.popleft()
if current == end:
return True
if current in visited:
continue
visited.add(current)
for neighbor in graph[current]:
if neighbor not in visited:
queue.append(neighbor)
return False