实验结果表明该算法的性能优于其他主流深度优先算法。
The experimental results show that DFFCI outperforms other depth-first search algorithms.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
定义了树节点类来动态地反映节点间的链接关系，采用深度优先算法，快速识别网络拓扑结构的变化。
The Type of tree node is defined to show the link relation between nodes, and the depth-first strategy is employed to identify topology structure.
目前关联规则挖掘算法可以分为广度优先算法和深度优先算法两大类，每类都有经典高效的算法提出。
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.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes.
并针对电网故障的随机性特点，在面向对象环境中实现了对随机故障的模拟，同时用深度优先算法进行了快速的拓扑跟踪。
To accord with the network malfunction's randomicity, the stochastic malfunction simulation and realizes the topology tracking using the DFS in objected-oriented environment are realized.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
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.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
首先给出分段开关对等相关定义，提出基于深度优先的分段开关对遍历算法。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are proposed.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
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.
通过将交通路网中路径搜索的定向式启发策略与深度优先的树搜索算法相结合，提出了一种有效路径的定向树搜索算法。
Combining the directional heuristic strategy with the tree searching algorithm of depth priority, an orientated tree algorithm of searching efficient paths is proposed.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
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.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
在信息搜索子模块部分，采用有限区域深度——广度优先的算法进行自主搜索，使搜索具有一定的自主性和智能性；
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.
通过深度优先遍历流程树，利用单亲遗传算法对流程效劳停止优化组合。
Then, dynamic optimized the orders of service process by parthenogenetic algorithm in the process of depth-first traversal of the process tree.
通过修改搜索策略，用深度优先搜索法确定通 路的矩阵算法，模拟计算有单向回路的通风网络。
The simulative calculation method and the results of multi-fan-station ventilation network with unidirectional circuits are described.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
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.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
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.
应用推荐