It will then construct all feasible plans simultaneously using a bottom up, breath-first search strategy.

然后，它会用由下至上、宽度优先(bottom up, breadth - first)的搜索策略，同时构造所有可行的计划。

youdao

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.

本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。

youdao

This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.

本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。

youdao