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

In depth first search you may find "local" solutions - to truly find a global solution you need to traverse the entire graph (or use a heuristic).