Programming, Computer Science, Graph Theory, Graph, Mathematics.
these nifty search algorithms! Breadth First Search Breadth First Search (BFS) is a search algorithm developed by Konrad Zeus for his rejected PhD thesis in 1945. Breadth First Search searches all neighbours before it searches child nodes. In the below picture, once the start state (1) has been