MRECW Students E- Learning Point Computer Security Student (CSS)

BFS was invented in the late 1950s by E. F. Moore, who used to find the shortest path out of a maze, and discovered independently by C. Y. Lee as a wire routing algorithm

Breadth-first search

Order in which the nodes are expanded
Class	Search algorithm
Data structure	Graph
Worst case performance
Worst case space complexity