What is breadth-first search useful for?

Question

Usually when I\'ve had to walk a graph, I\'ve always used depth-first search because of the lower space complexity. I\'ve honestly never seen a situation that calls for a b

Answer 1

One example is traversing the filesystem (with limited recursive depth).

According to wikipedia, it's also useful for certain graph algorithms (bipartiteness, connected components).