#029BFS Missing Visited Set Causes Infinite Loop
dsa.easyDSA
1from collections import deque
2
3def bfs(graph, start):
4 queue = deque([start])
5 result = []
6
7 while queue:
8 node = queue.popleft()
9 result.append(node)
10 for neighbor in graph[node]:
11 queue.append(neighbor)
12
13 return result
no lines flagged
#029PracticeEasy10 min · 50 XP
BFS Missing Visited Set Causes Infinite Loop
A graph BFS hangs on any graph with cycles because nodes are revisited indefinitely.
Flagged lines
No lines flagged yet
What's wrong?
Flag a line or write a note to submit.