Translation: Breadth-first search is a computer or AI method for exploring a graph or tree by visiting all the nodes at one level before moving on to the next level. It works outward in layers, step by step. It is useful when you want to find the shortest path in terms of the number of steps, such as going from point A to point B in Google Maps.