Breadth-First Search (BFS)

Home > Computer Science > Algorithms and data structures > Graph Traversal > Breadth-First Search (BFS)

A graph traversal algorithm that traverses a graph level by level, exploring all the nodes at a particular level before moving on to the next level.