Breadth-First Search (BFS) is a fundamental graph traversal algorithm used to explore the nodes and edges of a graph or tree data structure. It starts at a specified node (known as the "source" or "starting node") and explores all its neighboring nodes at the present depth prior to moving on to nodes at the next depth level.
New to topics? Read the docs here!