实现连通无向图的深度和广度优先遍历。
Connectivity to the map without the depth and breadth - first traversal.
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
最后得出结论，用广度优先的遍历方法创建网格是生成三角网格一种相对便利有效率的方法；
Finallg, the author got the conclusion that Width First Traversal method is more effective and convenient.
最后得出结论，用广度优先的遍历方法创建网格是生成三角网格一种相对便利有效率的方法；
Finallg, the author got the conclusion that Width First Traversal method is more effective and convenient.
应用推荐