Iterative BFS

• Bfs(v) { Queue q = new Queue(); s.enqueue(v); mark v as visited; while (!s.isEmpty()) { w = q.dequeue(); // working on nodes reachable // from node w // do any processing of w needed. for (each unvisited node u adjacent to w) { mark u as visited q.enqueue(u); } } }