Breadth-first search - Wikipedia
Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored.
Breadth-first search - Wikipedia Jump to content From Wikipedia, the free encyclopedia Algorithm to search the nodes of a graph This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed. Find sources:   "Breadth-first search"  –  news   · newspapers   · books   · scholar   · JSTOR ( April 2012 ) ( Learn how and when to remove this message ) Breadth-first search Animated example of a breadth-first search. Black = explored, grey = queued
saved by
related reading
- Depth-first search - Wikipediaen.wikipedia.org
- Algorithm - Wikipediaen.wikipedia.org
- Introduction of B Tree - GeeksforGeeksgeeksforgeeks.org
- Beam Search Algorithm | Baeldung on Computer Sciencebaeldung.com
- Graph cheatsheet for coding interviews | Tech Interview Handbooktechinterviewhandbook.org
- Monte Carlo Tree Search: An Introduction | Towards Data Sciencetowardsdatascience.com
- Binary search - Wikipediaen.wikipedia.org
- How the quantum search algorithm worksquantum.country
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Backtracking - Wikipediaen.wikipedia.org
- What is Beam Search? Explaining The Beam Search Algorithm | Width.aiwidth.ai
- Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyterboyter.org