breadth-first search in this sectionwe consider the breadth-first search (bfstraversal algorithm like dfsbfs traverses connected component of graphand in so doing defines useful spanning tree bfs is less "adventurousthan dfshowever instead of wandering the graphbfs proceeds in rounds and subdivides the vertices into