Introduction - If you have any usage issues, please Google them yourself
Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of important plans of the prototype algorithm. Single-source Dijkstra shortest path algorithm and Prim minimum spanning tree algorithm has been adopted and breadth-first search for a similar idea