depth-first造句
例句与造句
- Therefore , we can implement the depth - first traversal in the
因此，我们可以在抽象 - Depth - first visitors and broken dispatches
深度优先访问器和中断的分派 - With depth - first visitors , this is especially easy to do
通过深度优先访问器，特别容易发生这种情况。 - Diagnosing java code : depth - first visitors and broken dispatches
诊断java代码:深度优先访问器和中断的分派 - The search is depth - first
该搜索为深度优先。 - It's difficult to find depth-first in a sentence. 用depth-first造句挺难的
- Depth - first visitors ,
深度优先访问器 - Note that it is possible to select other algorithms besides a depth - first walk
注意，也可以选择深度优先遍历之外的其他算法。 - Depth - first search
深度优先搜索 - Also , the implementor of a depth - first visitor would have handy in the signatures of the
另外，对于每种类型，深度优先访问器的实现将有一个容易获得（在 - So there you have it : depth - first visitors , why they re cool , and how they can bite you
因此，您就知道了为什么深度优先访问器很酷以及它们会怎样刺痛您。 - For visitors that descend depth - first in all but a few cases , we can still use a depth - first visitor
对于大多数向下深度优先的访问器，我们仍可以使用深度优先访问器。 - Depth - first visitors are constructed by the " java tree builder , " a free tool available in
深度优先访问器是通过“ java树构建器（ java tree builder ） ”构造的，它是一种可以从 - The first one is a typical xslt stylesheet ; the second is a rewriting that exposes the depth - first walk
第一个是典型的xslt样式表，第二个对第一个进行了改写，以便公开所采用的深度优先遍历算法。 - Performs a depth - first walk of the input tree , this is the same depth - first algorithm you learned in programming 101
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。 - The processor takes care of much of the basic coding such as looping and passing parameters to implement a depth - first search
，可以看出处理程序处理了很多基本代码（比如循环和传递参数） ，以便实现深度优先的搜索。
更多例句： 下一页