This provides a breadth-first search.
这提供了一种广度优先的搜索。
A network topology discovery algorithm based on breadth-first is introduced.
介绍了一种基于广度优先的网络拓扑发现算法。
The pseudo column value is also used to sort the query results in breadth-first sequence.
还可以使用伪列值按照宽度优先顺序对查询结果进行排序。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
The breadth-first service model development helps to identify right service candidates and reuse capabilities.
宽度优先的服务模型开发有助于识别正确的服务候选者和重用能力。
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
Instead of trying to predict the future trends from the beginning, take a breadth-first approach and get the basics right.
不是从一开始就尝试预测将来的趋势，而是采用宽度优先的方法并保证基本要素正确。
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.
本文给出互连网络上的广度优先搜索算法，并将其应用到螺旋立方体上。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
The right way to learn math is breadth-first not depth-first. You need to survey the space learn the names of things figure out what's what.
正确学习数学的方法是广度优先，而非深度优先。你要考察的是整个数学世界，学习每个概念的名字，区分出什么是什么。
The right way to learn math is breadth-first, not depth-first. You need to survey the space, learn the names of things, figure out what's what.
正确学习数学的方法是广度优先，而非深度优先。你需要生存在空间里，学习事物的名字，区分出什么是什么。
The right way to learn math is breadth-first, not depth-first. You need to survey the space, learn the names of things, figure out what's what.
正确学习数学的方法是广度优先，而非深度优先。你要考察的是整个数学世界，学习每个概念的名字，区分出什么是什么。
Firstly, the basic algorithm to analyze web analytics Summary: If breadth-first strategy based on priority strategies and best way to crawl web pages.
首先对基本的网页分析算法进行分析综述：如基于广度优先策略和最佳优先策略的网页抓取方法。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth-first approach.
顺序开发(例如瀑布开发模式)的问题是，它强制设计人员采用深度优先而非广度优先方法。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
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.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
Finally, the characteristics and connection strategies of generator are presented, and based on subsume index, a breadth-first algorithm for mining non-redundant association rule is proposed.
最后，讨论了生成子的性质及连接策略，并在包含索引的基础上，给出了一种宽度优先的无冗余关联规则挖掘算法。
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.
SEARCHBREADTH FIRST是默认顺序，在返回下一层数据前会先返回同级的所有数据。
The underlying problem is that DB2 processes recursion by essentially producing one level of recursion at a time (breadth first), while Oracle uses depth first.
在底层，DB2处理递归时采用的方法是逐层递归（广度优先），而Oracle采用的是深度优先的方法。
The pseudo column LEVEL can be used in the ORDER BY clause to return the result set in search breadth first sequence.
可在ORDERBY 子句中使用伪列LEVEL按照搜索宽度优先顺序返回结果集。
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.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
提出基于单元树结构的广度优先搜索算法utbfs。
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.
结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
In this paper, we first describe ATM net structure, then analyze partial structure of fixed length and influence to tape breadth and last probe into ATM technology and emulation.
本文首先描述ATM的网络结构，然后分析固定长度的信元结构及对带宽的影响，最后探讨AT M技术与仿真。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
But USES based on the breadth first algorithm, in only considered one to two time trades while the actual situation in, can the effective realization most superior way inquiry.
而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
But USES based on the breadth first algorithm, in only considered one to two time trades while the actual situation in, can the effective realization most superior way inquiry.
而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
应用推荐