Los Angeles Times

Column: Finding a shortest path and Breadth-first search

What is a Breadth-first search? If you have a tree structure as below and visit the root node, and then all of its children, and all of its children’s children, and ...