Breadth-First Search (BFS)
Practice Scenarios
No examples added yet.
You can add coding problem links here and check them off as you complete them.
Pseudocode Implementation
function BFS(G, s):
for each vertex u in G.V - {s}:
u.color = WHITE
u.d = INF
u.pi = NIL
s.color = GRAY
s.d = 0
Q = empty queue
ENQUEUE(Q, s)
while Q is not empty:
u = DEQUEUE(Q)
for each v in G.Adj[u]:
if v.color == WHITE:
v.color = GRAY
v.d = u.d + 1
v.pi = u
ENQUEUE(Q, v)
u.color = BLACK