BFS and its application in finding
connected components of graphs were invented in 1945 by
Konrad Zuse and Michael Burke, in their (rejected) Ph.D. thesis on the
Plankalkül programming language, but this was not published until 1972.
[2] It was reinvented in 1959 by
Edward F. Moore, who used it to find the shortest path out of a maze,
[3][4] and later developed by C. Y. Lee into a
wire routing algorithm (published 1961).
[5]
If you want to change selection, open document below and click on "Move attachment"
Breadth-first search - Wikipediasing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key' [1] ) and explores the neighbor nodes first, before moving to the next level neighbours.
<span>BFS and its application in finding connected components of graphs were invented in 1945 by Konrad Zuse and Michael Burke, in their (rejected) Ph.D. thesis on the Plankalkül programming language, but this was not published until 1972. [2] It was reinvented in 1959 by Edward F. Moore, who used it to find the shortest path out of a maze, [3] [4] and later developed by C. Y. Lee into a wire routing algorithm (published 1961). [5]
Contents
1 Pseudocode
1.1 More details 1.2 Example
2 Analysis
2.1 Time and space complexity 2.2 Completeness
3 BFS ordering 4 Applications 5 See also 6 References 7 Ext Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details