BFS (cont)

• From “f” we add “g” and add edge f-g to the spanning tree

• Queue: “i”, “c”, “e”, “g”