breadth-first search
algorithm for searching the nodes of a graph in order by their hop count from a starting node
Facts
8 propertiesIdentity
- Instance of
- uninformed search algorithm
More facts +7
- Subclass of
- graph traversal[3]
- Short name
- BFS[5]
- Discoverer or inventor
- Konrad Zuse[2]
- Time of discovery or invention
- 1945[4]
- Worst-case space complexity
- O(|V|) = O(b^d)
- Worst-case time complexity
- O(|V|+|E|) = O(b^d)
🏷️ Also known as
en breadth-first search
en BFS
en breadth first search
ar البحث المتسع الاول
cs prohledávání do šířky
cs Breadth-first search
cs procházení do šířky
de Breitendurchlauf
de Breitensuche
el Αναζήτηση κατά πλάτος
es busqueda en anchura
es búsqueda en anchura
es primero en anchura
fa الگوریتم جستجوی یکم سطح
fa الگوریتم جستجوی اول سطح
fa بیافاس
fa جستجوی سطح اول
fa جستجوی سطح یکم
fi leveyshaku
fi leveyssuuntainen läpikäynti
🔖 Identifiers · 15
- OpenAlex ID
- C138843760
- Image (Wikimedia Commons)
- Breadth-first-tree.svg ↗
- Brilliant Wiki ID
- breadth-first-search-bfs
- De Agostini ID
- breadth-first+search
- Described at URL
- www.javatpoint.com
- Dictionary of Algorithms and Data Structures ID
- bfs, breadthfirst
- Encyclopedia of China (Third Edition) ID (2026)
- 2HFdi6
- Encyclopedia of China (Third Edition) old ID (2021)
- 509027
- Freebase ID
- /m/0p0jb
- GitHub topic
- breadth-first-search
- GitLab.com topic ID
- breadth-first-search
- Golden ID (archived)
- Breadth-first_search-8N4GJ
Show all 15 identifiers +3
- Microsoft Academic ID (discontinued)
- 138843760
- Quora topic ID
- Breadth-first-Search-1
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Uses 2
Discoverer or inventor 1
Subclass of 1
← Based on 1
← Facet of 1
Press Enter · cited answer in seconds
0 sources
Summary
breadth-first search is an uninformed search algorithm[1].