BFS first dequeue

• From “b” we add “c” and “e” to the queue and add edges b-c and b-e to the spanning tree

• Queue: “f”, “I”, “c”, “e”