Breadth-First

• Starting arbitrarily at “a” we consider and add “b”, “I” and “f” to a queue and the edges a-b, a-i, and a-f to the spanning tree

• The queue: “b”, “f”, “i”