Breadth First Paths Algorithm

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. BFS and its application in finding connected components of graphs were invented in 1945 by Konrad Zuse, in his (rejected) Ph.D. thesis on the Plankalk├╝l programming language, but this was not published until 1972.

Breadth First Paths source code, pseudocode and analysis

COMING SOON!