Bfs
Breadth First Search
BFS stands for Breadth-First Search, an algorithm used in graph traversal or search that explores all neighbors at the present depth level before moving on to nodes at the next depth level.