This provides a breadth-first search.
这提供了一种广度优先的搜索。
The second algorithm is also derived from the breadth-first search method.
第二个算法也是基于广度优先搜索策略。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
Tree breadth-first search and tree memory can be fulfilled by setting up and making access of data list in the paper.
通过建立表、访问表来实现树的存储和广度优先搜索。
In this paper, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube.
本文给出互连网络上的广度优先搜索算法，并将其应用到螺旋立方体上。
Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
The system builds firstly the objective state of the container stack on the principle and then searches for the steps of turning box using the non-conventional breadth-first search algorithm.
混合优化策略首先根据堆箱规则构造集装箱堆栈目标状态，然后运用改进广度优先算法搜索搬箱步骤。
Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
SEARCH BREADTH FIRST is the default sequence and returns all data on the same level first before returning any data on the next level.
SEARCH BREADTH FIRST是默认顺序，在返回下一层数据前会先返回同级的所有数据。
The pseudo column LEVEL can be used in the ORDER BY clause to return the result set in search breadth first sequence.
可在ORDERBY 子句中使用伪列LEVEL按照搜索宽度优先顺序返回结果集。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
提出基于单元树结构的广度优先搜索算法utbfs。
The shortest topological distance between two atoms in a structure was designed according to the widely used breadth first search algorithm which uses a data structure called Queue.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
Python: Breadth First Search capable of returning largest distance?
广度优先搜索能够返回的最大距离？
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
A topology analysis method based on adjacent relation of elements in the network and Breadth first search is realized combined with Graph theory and the characteristics of power grid.
结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
Diffuse water source routines for the implementation of the breadth first search algorithm of diffuse water easy language breadth first search.
易语言广度优先搜索实现漫水法源码例程程序通过广度优先搜索实现了漫水算法。可用于去除图像杂色，分割图像等。
Is it because the breadth first search always finds the shortest path?
这是因为广度优先搜索，总能找到最短路径？
Is it because the breadth first search always finds the shortest path?
这是因为广度优先搜索，总能找到最短路径？
应用推荐