图——广度优先搜索(Graph - Breadth First Search)
简介(Introduction)
Breadth-first search(BFS) visits all nodes in alphabetical order that are one step away from start node, then all nodes that are two steps away from start node, and so on.
DFS order: a, b, c, d, e, f, g.
检索队列(The Traversal Queue)
We can use a queue to track where we are in overall process. For above graph,
Inject queue order: a,