Breadth-First Search (BFS)
BFS is a traversal algorithm in graph theory. Please see BFS for more details.
BFS is also very commonly used in searching problems in which each state corresponds to a node in the graph.
buildLast update and/or translate time of this article，Check the history
editFound smelly bugs? Translation outdated? Wanna contribute with us? Edit this Page on Github
peopleContributor of this article OI-wiki
translateTranslator of this article Visit the original article!
copyrightThe article is available under CC BY-SA 4.0 & SATA ; additional terms may apply.