Agent Engineering
Breadth-First Search
Breadth-first search explores a graph outward in layers from a starting node, visiting immediate neighbors before more distant ones. With unweighted edges it finds minimum-hop distances to reachable nodes. Neighbor ordering determines tie order, while weights require a different interpretation and often a different shortest-path algorithm.
Also called: BFS
Reviewed
Sources
Member lesson
The definition and sources are public. The complete practical lesson is for members.