Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The basic idea of the algorithm is this: a depth-first search begins from an arbitrary start node (and subsequent depth-first searches are conducted on any nodes that have not yet been found).
基本思想是：从任意一个结点出发深搜（后续的深搜要在未访问过的结点上进行）。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
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.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are 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.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
Then, dynamic optimized the orders of service process by parthenogenetic algorithm in the process of depth-first traversal of the process tree.
通过深度优先遍历流程树，利用单亲遗传算法对流程效劳停止优化组合。
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.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
应用推荐