To be systematic, I'm going to build this tree depth-first left-first.
为了保持系统性，我将要把这棵树设置，为深度优先和左边优先。
At Revelytix, we always traverse the nodes in the depth-first order of the zipper enumeration.
在Revelytix中，我们始终按照zippers枚举深度优先的顺序遍历节点。
The experimental results show that DFFCI outperforms other depth-first search algorithms.
实验结果表明该算法的性能优于其他主流深度优先算法。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
In other words, instead of going depth-first (to the children), it goes through the adjacent elements.
换句话说，它没有选择深度优先(到达子代)，而是遍历相邻元素。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
In the inference engine section, target-drive control, depth-first search and breadth-first search are adopted.
在推理机的设计中采用了目标驱动控制，以及深度优先搜索和广度优先搜索这两种搜索策略；
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
The definition of coupled-switches (CS) and the traversal algorithm for CSs using the depth-first method are proposed.
首先给出分段开关对等相关定义，提出基于深度优先的分段开关对遍历算法。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
The temporarily created field SORT is used within the ORDER BY clause, to get the result returned in the depth-first sequence.
临时创建的字段sort用于ORDERby子句内，以便按深度优先顺序获得返回的结果。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
To solve the above two problems, authors propose a new depth-first algorithm to discover weighted maximal frequent subgraphs only.
为解决上述问题，提出了一种深度优先的挖掘加权最大频繁子图的新算法。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
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 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 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 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 Type of tree node is defined to show the link relation between nodes, and the depth-first strategy is employed to identify topology structure.
定义了树节点类来动态地反映节点间的链接关系，采用深度优先算法，快速识别网络拓扑结构的变化。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth-first approach.
顺序开发(例如瀑布开发模式)的问题是，它强制设计人员采用深度优先而非广度优先方法。
The problem with sequential development (for example, waterfall) is that it forces designers to take a depth-first rather than a breadth -first approach.
顺序开发（例如瀑布开发模式）的问题是，它强制设计人员采用深度优先而非广度优先方法。
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遍历的顺序，需要访问每个叶节点。
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.
采用项集格生成树的数据结构，将最大频繁项集挖掘过程转化为对项集格生成树进行深度优先搜索获取所有最大频繁节点的过程。
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.
提出二维矢量工作队列数据结构，保证站点深度优先搜索以及权值对站点处理时间的影响。
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，可以看出处理程序处理了很多基本代码(比如循环和传递参数)，以便实现深度优先的搜索。
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).
基本思想是：从任意一个结点出发深搜（后续的深搜要在未访问过的结点上进行）。
To show how the defense in depth works, we will first examine a centric model of three primary layers: core, middle, and outermost.
为了演示深度防御的工作原理，我们将首先研究包含三个主要层次的中心模型：核心层、中间层和最外层。
To show how the defense in depth works, we will first examine a centric model of three primary layers: core, middle, and outermost.
为了演示深度防御的工作原理，我们将首先研究包含三个主要层次的中心模型：核心层、中间层和最外层。
应用推荐