These two steps repeat recursively and depth first.
这两步递归地以深度优先的方式重复。
Design in the depth first, the accessibility later.
这是第一条准则。
As you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
正如您所见到的，该文件是深度优先遍历，但不一定在任何目录内按字母顺序来进行。
SEARCH DEPTH first must be specified if all child data (over all levels) must be returned first before returning the data of the next parent.
如果必须在返回下一个父数据的数据之前返回所有的子数据(所有级别上)，则必须指定SEARCHDEPTH FIRST。
The underlying problem is that DB2 processes recursion by essentially producing one level of recursion at a time (breadth first), while Oracle uses depth first.
在底层，DB2处理递归时采用的方法是逐层递归（广度优先），而Oracle采用的是深度优先的方法。
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.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
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.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
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.
目前关联规则挖掘算法可以分为广度优先算法和深度优先算法两大类，每类都有经典高效的算法提出。
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.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
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.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
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.
通过比较清单2和清单3，可以看出处理程序处理了很多基本代码(比如循环和传递参数)，以便实现深度优先的搜索。
To show how the defense in depth works, we will first examine a centric model of three primary layers: core, middle, and outermost.
为了演示深度防御的工作原理，我们将首先研究包含三个主要层次的中心模型：核心层、中间层和最外层。
In other words, instead of going depth-first (to the children), it goes through the adjacent elements.
换句话说，它没有选择深度优先(到达子代)，而是遍历相邻元素。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth-first approach.
顺序开发(例如瀑布开发模式)的问题是，它强制设计人员采用深度优先而非广度优先方法。
Now the strategy of the NRC in term of defense in depth is obviously first of all design the plant such that accidents are prevented.
现在NRC关于纵深防御的策略,很明显是所有的电站设计的第一个,这样就能防止事故的发生。
The temporarily created field SORT is used within the ORDER BY clause, to get the result returned in the depth-first sequence.
临时创建的字段sort用于ORDERby子句内，以便按深度优先顺序获得返回的结果。
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
At Revelytix, we always traverse the nodes in the depth-first order of the zipper enumeration.
在Revelytix中，我们始终按照zippers枚举深度优先的顺序遍历节点。
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.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
This term was explained in depth in the first article of this series; it simply means that you should begin by creating your VXML file normally, as a static document, before you do anything else.
这一术语在本系列的第一篇文章中已进行了深入的探讨。简单地说，它表示您通常应该从创建VXML文件开始(采用静态文档的形式)，然后再去做其他事。
Compared to in-depth news coverage, first-person Tweets of on-the-ground events, such as the 2008 Mumbai bombings, is generally unmoving.
与全面深入的新闻报道相比，以第一人称唠叨的当场事件，如2008年的孟买爆炸事件，一般是不动人的。
The right way to learn math is breadth-first, not depth-first. You need to survey the space, learn the names of things, figure out what's what.
正确学习数学的方法是广度优先，而非深度优先。你需要生存在空间里，学习事物的名字，区分出什么是什么。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
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 algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The right way to learn math is breadth-first not depth-first. You need to survey the space learn the names of things figure out what's what.
正确学习数学的方法是广度优先，而非深度优先。你要考察的是整个数学世界，学习每个概念的名字，区分出什么是什么。
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.
采用深度优先搜索法，文章首次提出了在搜索过程中采用标记距离的算法，有效地求解复杂网络和图的最短距离问题。
应用推荐