You are using an out of date browser. It may not display this or other websites correctly. You should upgrade or use an alternative browser.
Join the #1 community for gun owners of the Northwest
We believe the 2nd Amendment is best defended through grass-roots organization, education, and advocacy centered around individual gun owners. It is our mission to encourage, organize, and support these efforts throughout Oregon, Washington, Idaho, Montana, and Wyoming.
Discuss firearms and all aspects of firearm ownership
Join others in organizing against anti-gun legislation
Buy, sell, and trade in our classified section
Find nearby gun shops, ranges, training, and other resources
Discover free outdoor shooting areas
Stay up to date on firearm-related events
Share photos and video with other members
...and much more!
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
It uses the opposite strategy as depth-first search, which instead explores the highest-depth nodes first before being forced to backtrack and expand shallower nodes.
BFS and its application in finding connected components of graphs were invented in 1945 by Konrad Zuse, in his (rejected) Ph.D. thesis on the Plankalkül programming language, but this was not published until 1972.
It was reinvented in 1959 by Edward F. Moore, who used it to find the shortest path out of a maze, and later developed by C. Y. Lee into a wire routing algorithm (published 1961).