BFS(cont)

• Nothing gets done from “i”, from “c” we add “d” to the queue and edge c-d to the spanning tree.

• Queue: “e”, “g”, ”d”