depth-first
美 
英
例句
Depth-first walking means that the processor visits all the children of a given node recursively until it has processed the entire document.
深度优先遍历意味着，处理器递归访问某一给定节点的所有子代，直到处理了整个文档为止。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
In other words, instead of going depth-first (to the children), it goes through the adjacent elements.
换句话说，它没有选择深度优先（到达子代），而是遍历相邻元素。
Note that it is possible to select other algorithms besides a depth-first walk.
注意，也可以选择深度优先遍历之外的其他算法。
Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation.
建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。
By default, it does what's known as a depth-first walk in a tree.
缺省情况下，它执行所谓的树中深度优先遍历。
As you can see, the file traversal is depth first but not necessarily in any alphabetical order within a directory.
正如您所见到的，该文件是深度优先遍历，但不一定在任何目录内按字母顺序来进行。
Trial design an algorithm, depth first search strategy by the topology of its sort.
试设计一个算法，按深度优先搜索策略对其进行拓扑排序。
This results in breadth-first traversal (compared to digging down into the first link found, which would result in depth-first behavior).
这会产生广度优先遍历（与优先处理首先找到的第一个链接不同，后者是一种深度优先遍历）。
Establish a table to store the adjacency have already established the graph depth first and breadth-first traversal operation.
建立有向图的邻接表存储；对已经建立的有向图进行深度优先和广度优先遍历操作。
The approach divided the exploring region into several sub-regions, and then used the particle swarm to depth-first search the sub-regions.
该方法将待探索区域划分为若干个子区域，利用粒子群优化算法深度优先搜索子区域。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Breadth-first search and Depth-first search are two often used search algorithms.
宽度优先搜索和深度优先搜索是图论中常用的两种搜索算法。
The experimental results show that DFFCI outperforms other depth-first search algorithms.
实验结果表明该算法的性能优于其他主流深度优先算法。
At Revelytix, we always traverse the nodes in the depth-first order of the zipper enumeration.
在Revelytix中，我们始终按照zippers枚举深度优先的顺序遍历节点。
The first one is a typical XSLT stylesheet; the second is a rewriting that exposes the depth-first walk.
第一个是典型的XSLT样式表，第二个对第一个进行了改写，以便公开所采用的深度优先遍历算法。
Based on the depth-first searching method, all the frequent subgraphs could he searched by adding edges progressively.
在此基础上，算法利用深度优先的思想，通过逐步扩展频繁边找出所有频繁子图。
These two steps repeat recursively and depth first.
这两步递归地以深度优先的方式重复。
This paper proposes an automatic generation of basis path set method based on depth-first searching.
基路径测试作为路径测试的一种重要手段，是软件自动化测试的热点。
We call this variant the Depth-First Visitor pattern.
我们将这个变体称为Depth-FirstVisitor模式。
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 second is a depth-first search algorithm.
次之为先深后广的搜寻演算法。
So there you have it: depth-first visitors, why they re cool, and how they can bite you.
因此，您就知道了为什么深度优先访问器很酷以及它们会怎样刺痛您。
Bit plane-parallel VLSI architecture for a modified SPIHT algorithm using depth-first search bit stream processing
用深度优先搜索流处理的比特平面并行SPIHT编码结构
Improved depth-first search algorithm for valued constraint satisfaction problem
加权约束满足问题的改进深度优先搜索算法
Application of the depth-first search method in the calculation of water supply pipe networks
深度优先搜索在给水管网计算中的应用
Depth-first Diffused Formation Algorithm of Service Supply Chain
服务供应链深度优先扩散构建算法
A Depth-First-Search-Based Algorithm of Web Services Composition
基于深度优先搜索的Web服务合成算法
Depth first searching methodand display of the vector graph
有向图的先深遍历与显示
A novel trajectory pattern learning method based on vector quantization and depth first search
基于矢量量化和深度优先搜索的轨迹分布模式学习算法
A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets
一种挖掘最大频繁项集的深度优先算法
This article analyse the needs in-depth first;
本文，首先进行了深入的需求分析；
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
therefore , we can implement the depth - first traversal in the
因此，我们可以在抽象
