Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03868956n
Noun Concept
Categories: Search algorithms, Graph algorithms, All articles needing additional references
EN
breadth-first search  Applications of breadth-first search  BFS  BFS algorithm  breadth-first
EN
Breadth-first search is an algorithm for searching a tree data structure for a node that satisfies a given property. Wikipedia
Definitions
Relations
Sources
EN
Breadth-first search is an algorithm for searching a tree data structure for a node that satisfies a given property. Wikipedia
A graph search algorithm Wikipedia Disambiguation
Algorithm for searching the nodes of a graph in order by their hop count from a starting node Wikidata
A graph search algorithm that considers neighbors of a vertex, that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. OmegaWiki
A search algorithm that begins at the root node and explores all the neighboring nodes. Wiktionary
A search algorithm. Wiktionary (translation)
IS A
graph traversal
uninformed search algorithm
search algorithm
DISCOVERER OR INVENTOR
Konrad Zuse
USES
graph
Wikipedia
EN
breadth-first search
Wikidata
EN
breadth-first search
Wiktionary
EN
breadth-first search
OmegaWiki
EN
breadth-first search
Wikipedia Redirections
EN
Applications of breadth-first search, BFS algorithm, breadth-first, Breadth-First Search, breadth-first traversal, Breadth first recursion, breadth first search, Breath-first search, Breath first search
Wikidata Alias
EN
BFS, breadth first search

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License