Breadth-First Search
1/0
1.0x
Breadth-First Search
O(V + E)
Space: O(V)
Pseudocode
1
procedure BFS(graph, start)
2
create queue Q
3
mark start as visited
4
enqueue start into Q
5
while Q is not empty do
6
v ← dequeue from Q
7
process v
8
for each neighbor u of v do
9
if u is not visited then
10
mark u as visited
11
enqueue u into Q
Random Input