而采用基于广度优先算法，在只考虑一到两次换乘的实际情况下，能有效的实现最优路径的查询。
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.
混合优化策略首先根据堆箱规则构造集装箱堆栈目标状态，然后运用改进广度优先算法搜索搬箱步骤。
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.
目前关联规则挖掘算法可以分为广度优先算法和深度优先算法两大类，每类都有经典高效的算法提出。
By far, association rule mining algorithms can be divided into two main classes: width first and depth first. There are classical and efficient algorithms in each class.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
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.
提出基于单元树结构的广度优先搜索算法utbfs。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
推理时，在“向导式”模式下，利用“类广度”优先搜索算法完成农作物病害的前向推理。
When we speculate, with the "Wizard" method, we use "breadth" of the disease priority search algorithm to complete reasoning.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
介绍了一种基于广度优先的网络拓扑发现算法。
A network topology discovery algorithm based on breadth-first is introduced.
结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
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, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube.
第二个算法也是基于广度优先搜索策略。
The second algorithm is also derived from the breadth-first search method.
在信息搜索子模块部分，采用有限区域深度——广度优先的算法进行自主搜索，使搜索具有一定的自主性和智能性；
In the resource-searched sub-module it uses the limited depth-breadth priority algorithm to search the resources automatically. Thus the searching is self-determination and intelligence.
利用广度优先搜索（BFS）算法的思想实现了这种网络的搜索，从而实现了相关修改。
Then by means of BFS algorithm we achieve the search of this meshwork, together with the correlated - modification.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
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.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法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.
首先对基本的网页分析算法进行分析综述：如基于广度优先策略和最佳优先策略的网页抓取方法。
Firstly, the basic algorithm to analyze web analytics Summary: If breadth-first strategy based on priority strategies and best way to crawl web pages.
易语言广度优先搜索实现漫水法源码例程程序通过广度优先搜索实现了漫水算法。可用于去除图像杂色，分割图像等。
Diffuse water source routines for the implementation of the breadth first search algorithm of diffuse water easy language breadth first search.
易语言广度优先搜索实现漫水法源码例程程序通过广度优先搜索实现了漫水算法。可用于去除图像杂色，分割图像等。
Diffuse water source routines for the implementation of the breadth first search algorithm of diffuse water easy language breadth first search.
应用推荐