Category:Breadth-first search
From LiteratePrograms
This category contains implementations of breadth-first search, a simple graph search algorithm. Compared to depth-first search, it always finds the shortest path, but can require much more space.
This category contains implementations of breadth-first search, a simple graph search algorithm. Compared to depth-first search, it always finds the shortest path, but can require much more space.