File:Animated_BFS.gif · Wikimedia Commons · See Wikimedia Commons
Tìm kiếm theo chiều rộng
Sign in to saveAlso known as BFS, breadth first search
algorithm for searching the nodes of a graph in order by their hop count from a starting node
Key facts
- Class
- Search algorithm
- Data structure
- Graph
- Worst case performance
- O ( | V | + | E | ) {\displaystyle O(|V|+|E|)}
- Worst case space complexity
- O ( | V | ) {\displaystyle O(|V|)}
- Optimal
- Yes (always finds shortest paths)
via Wikipedia infobox
Wikidata facts
- Subclass of
- graph traversal
- Image
- Breadth-first-tree.svg
Show 7 more facts
- time of discovery or invention
- 1945-00-00
- Commons category
- Breadth-first search
- Stack Exchange tag
- stackoverflow.com/tags/breadth-first-search
- uses
- FIFO
- discoverer or inventor
- Konrad Zuse
- short name
- BFS
- described at URL
- www.javatpoint.com/ai-uninformed-search-algorithms
via Wikidata · CC0