Breadth First Search

Breadth First Search (BFS) explores a graph level by level, starting at a node and visiting all its neighbors before moving on to the next level. It uses a queue to manage nodes. BFS is ideal for finding the shortest path in an unweighted graph and for checking connectivity.