breadth-first search
algorithm for searching the nodes of a graph in order by their hop count from a starting node
Press Enter · cited answer in seconds
0 sources
breadth-first search
Summary
breadth-first search is an uninformed search algorithm[1]. It has Wikipedia articles in 27 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- breadth-first search is credited with the discovery of Konrad Zuse[3].
- breadth-first search's instance of is recorded as uninformed search algorithm[4].
- breadth-first search is a type of graph traversal[5].
- breadth-first search's Commons category is recorded as Breadth-first search[6].
- breadth-first search's time of discovery or invention is recorded as 1945[7].
- breadth-first search's described at URL is recorded as https://www.javatpoint.com/ai-uninformed-search-algorithms[8].
- breadth-first search's Stack Exchange tag is recorded as https://stackoverflow.com/tags/breadth-first-search[9].
- breadth-first search's short name is recorded as {'lang': 'en', 'text': 'BFS'}[10].
- breadth-first search's uses is recorded as graph data structure[11].
- breadth-first search's uses is recorded as FIFO[12].
Body
Designation and Status
breadth-first search's instance of is recorded as uninformed search algorithm[4].
Why It Matters
breadth-first search has Wikipedia articles in 27 language editions, a strong signal of global cultural recognition.[2] It is known by 34 alternative names across languages and contexts.[13]