BFS Spanning Tree

• With nothing to be done for “h” the queue becomes empty and the final spanning tree found is:

• BFS visited nodes in the order: “a,b,f,i,c,e,g,d,h”