这两步递归地以深度优先的方式重复。
其控制结构是向前和混合拉链，单调深度优先查找。
Its control structure is a forward zipper with preferential seek for monotonous depth.
换句话说，它没有选择深度优先(到达子代)，而是遍历相邻元素。
In other words, instead of going depth-first (to the children), it goes through the adjacent elements.
实验结果表明该算法的性能优于其他主流深度优先算法。
The experimental results show that DFFCI outperforms other depth-first search algorithms.
为了保持系统性，我将要把这棵树设置，为深度优先和左边优先。
To be systematic, I'm going to build this tree depth-first left-first.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
首先给出分段开关对等相关定义，提出基于深度优先的分段开关对遍历算法。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are proposed.
在Revelytix中，我们始终按照zippers枚举深度优先的顺序遍历节点。
At Revelytix, we always traverse the nodes in the depth-first order of the zipper enumeration.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
顺序开发(例如瀑布开发模式)的问题是，它强制设计人员采用深度优先而非广度优先方法。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth-first approach.
在推理机制的实现上，系统采用正向推理的推理控制策略和深度优先的搜索策略。
In the realization of the inference engine, the forward inference control strategy and the deep-prior search strategy are preferred.
临时创建的字段sort用于ORDERby子句内，以便按深度优先顺序获得返回的结果。
The temporarily created field SORT is used within the ORDER BY clause, to get the result returned in the depth-first sequence.
正如您所见到的，该文件是深度优先遍历，但不一定在任何目录内按字母顺序来进行。
As you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
提出二维矢量工作队列数据结构，保证站点深度优先搜索以及权值对站点处理时间的影响。
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.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
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.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
顺序开发（例如瀑布开发模式）的问题是，它强制设计人员采用深度优先而非广度优先方法。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth -first approach.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
通过修改搜索策略，用深度优先搜索法确定通 路的矩阵算法，模拟计算有单向回路的通风网络。
The simulative calculation method and the results of multi-fan-station ventilation network with unidirectional circuits are described.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
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 Type of tree node is defined to show the link relation between nodes, and the depth-first strategy is employed to identify topology structure.
该实现算法以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.
目前关联规则挖掘算法可以分为广度优先算法和深度优先算法两大类，每类都有经典高效的算法提出。
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.
目前关联规则挖掘算法可以分为广度优先算法和深度优先算法两大类，每类都有经典高效的算法提出。
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.
应用推荐