Breadth-first search (BFS)

Home > Mathematics > Graph theory > Graph algorithms > Breadth-first search (BFS)

This algorithm is used to traverse a graph in a particular order, starting from the initial node and visiting all the nodes at the same level before moving on to the next level.