有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
According to this hybrid trust model, it presents an algorithm constructing a path base on a depth first search, and summarizes the path validation algorithm.
提出二维矢量工作队列数据结构，保证站点深度优先搜索以及权值对站点处理时间的影响。
Introduce a data structure of Two-dimensional Vector Workload to ensure Site-depth-first Searching Model and the time control of sites processing with weighted values.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
通过修改搜索策略，用深度优先搜索法确定通 路的矩阵算法，模拟计算有单向回路的通风网络。
The simulative calculation method and the results of multi-fan-station ventilation network with unidirectional circuits are described.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
Based on depth first search, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
设计了一种全局正向、局部反向的推理方式，并结合改进的与或树深度优先搜索策略建立了专家系统的推理机。
A overall-forward part-backward reasoning way is designed and an expert system reasoning machine is built with improved and-or tree deep priority searching strategy.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
The shortest path problem in complex networks and graphs can be easily solved by labeling the distance between current point and start point during depth- first- search.
采用项集格生成树的数据结构，将最大频繁项集挖掘过程转化为对项集格生成树进行深度优先搜索获取所有最大频繁节点的过程。
The itemset lattice tree data structure was adopted to translate maximal frequent itemsets mining into the process of depth-first searching the itemset lattice tree.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
A method to mark transitive predecessors and transitive successors by using depth first search is provided with a description of the algorithm based on stack.
通过比较清单2和清单3，可以看出处理程序处理了很多基本代码(比如循环和传递参数)，以便实现深度优先的搜索。
As you can see if you compare Listings 2 and 3, the processor takes care of much of the basic coding (such as looping and passing parameters) to implement a depth-first search.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
在推理机制的实现上，系统采用正向推理的推理控制策略和深度优先的搜索策略。
In the realization of the inference engine, the forward inference control strategy and the deep-prior search strategy are preferred.
通过将交通路网中路径搜索的定向式启发策略与深度优先的树搜索算法相结合，提出了一种有效路径的定向树搜索算法。
Combining the directional heuristic strategy with the tree searching algorithm of depth priority, an orientated tree algorithm of searching efficient paths is proposed.
在信息搜索子模块部分，采用有限区域深度——广度优先的算法进行自主搜索，使搜索具有一定的自主性和智能性；
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.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
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.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
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.
应用推荐