Breadth First Search (BFS)
BreadthFirstSearch (graph G, vertex v):
Queue Q; (initialized empty)
for each vertex w do Encountered(w) = false;
Encountered(v) = true;
Q.Enqueue(v);
while !Q.IsEmptyQueue() do
w := Q.Dequeue()
Visit(w)
for each neighbor w’ of w do
if !Encountered(w’) then
Encountered(w’) := true;
Parent(w’) = w;
Q.Enqueue w’)
Previous slide
Next slide
Back to first slide
View graphic version