depth-first tree
网络释义
depth-first spanning tree [计] 深度优先生成树
depth-first search tree 深度优先搜索树
Depth-First Search Spanning Tree 生成树
depth-first search Binary Tree 说明深度优先搜索二叉树
双语例句原声例句
-
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
-
Performs a depth-first walk of the input tree, this is the same depth-first algorithm you learned in programming 101.
对输入树进行深度优先的遍历，这和您在编程101中所学的深度优先算法没有什么不同。
-
A zipper's enumeration functions allow you to traverse the entire tree in depth-first order, as shown in Figure 11.
zippers的枚举函数允许您按照深度优先的顺序遍历整个树，如图11所示。
-
To be systematic, I'm going to build this tree depth-first left-first.
为了保持系统性，我将要把这棵树设置,为深度优先和左边优先。
应用推荐