广度优先搜索-Breadth-first search

广度优先搜索(Breadth-first seaech)

WIKI

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'), and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

定义

解决最短路径问题的算法

队列(queue)

• 入队

• 出队

WIKI

In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principle (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.

定义

队列是一种先进先出的数据结构