Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

Question

BFS and its application in finding connected components of graphs were invented in [...] 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]}

Answer

1945

Question

BFS and its application in finding connected components of graphs were invented in [...] 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]}

Answer

?

Question

BFS and its application in finding connected components of graphs were invented in [...] 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]}

Answer

1945

If you want to change selection, open original toplevel document below and click on "Move attachment"

#### Parent (intermediate) annotation

**Open it**

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 Edwar

#### Original toplevel document

**Breadth-first search - Wikipedia**

sing 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

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 Edwar

sing 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

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Do you want to join discussion? Click here to log in or create user.