在CVS分支树里标记这一模块。
本文提出一个用多分支树型结构实现管理系统的算法，给出了关于树型结构的几种算法。
The algorithms of using multiple branch tree structure to implement management system is proposed in the paper. As to several algorithms of tree structure is given.
采用按值分支树的多维综合流分类算法支持前缀和范围匹配，可扩展性强，适合大容量规则数据库。
The compositive multi-dimensional packet classification algorithm based on tree divided by value is scalable. It can deal with prefixes match and range match for large rule sets.
第二种技术是分类（即分类树或决策树），用来创建一个实际的分支树来预测某个未知数据点的输出值。
The second was classification (also known as classification tree or decision tree), which can be used to create an actual branching tree to predict the output value of an unknown data point.
因此，使用列表的列表，您就可以描述具有任意多个分支和叶子的树。
Using lists of lists, therefore, you can represent trees that have any number of branches and leaves.
由于命名靠外的第一个空间迭代器同时包含窗格al0和AL1，所以窗格名称后面的第一个数字是树中一个分支的组数字。
Since the first spatial iterator named outer encompasses both panes AL0 and AL1, the first digit following the pane name is a grouping digit for a branch in the tree.
举个例子，亚马逊这样的公司常常使用“购买了X的顾客还购买了Y ”特性，如果亚马逊拟创建一个分类树，那么它将需要多少分支和节点？
Think about a company like Amazon and the common "Customers who purchased X also purchased y" feature. If Amazon were to create a classification tree, how many branches and nodes could it have?
删除或安装应用程序(不是必须与可执行文件一一对应)只需要解包或删除文件系统树中的分支。
Deleting or installing applications (which is not necessarily one-to-one with executables) is just a matter of unpacking or deleting branches to the file system tree.
树中的内部节点是采用ELSE分支的任务。
Internal nodes in the tree are tasks that take the ELSE branch.
该树将有两个主要分支，V5Query(描述用户希望看到什么)和V5QueryResultSet (QRD)，后者描述用户希望如何看到结果(列表或交叉表)。
The tree will have two main branches, the V5Query (describing what the user wants to see) and the V5QueryResultSet (QRD) which describes how the user wants to see the results (list or crosstab).
outline使用的seed非常简单，它只是一个字符串，到达树的分支的深度越深，该字符串就越长。
The seed used in outline is quite simple; it is just a string that gets longer as deeper branches of the tree are reached.
如果您玩过使用3d树的视频游戏，就会知道，这类游戏很可能使用fibonacci数列来确定分支和叶的位置。
If you play video games with 3d trees, the arrangement of the branches and leaves were probably calculated using the Fibonacci series to determine the location of the branches and leaves.
第二条分支到树的特殊遍历中（有关详细信息，请参阅 following-sibling轴线侧栏）。
The second one branches off into a special walking of the tree (see the The following-sibling Axis sidebar for details).
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
Now, the decision tree, if I branch left, it's a binary tree.
要了解这一过程的工作原理，请将XML文档考虑成树结构，其中元素的嵌套定义了树的分支。
To see how this works, think of XML documents as tree structures, where the nesting of elements define branches of the tree.
树安全标签组件：树是一个元素集合，用于表示有多个节点和分支的复杂层次关系。
Tree security label component: a tree is a collection of elements representing a complex hierarchy having multiple nodes and branches.
该风格的算法将生成一棵树，其中树叶由采用THEN分支的任务定义。
This algorithm style will produce a tree whose leaves are defined by tasks that take the THEN branch.
当分支稳定后，再将分支与主树进行合并。
When they are stable, you can merge branches back to the main tree.
但是假设我们要在图1所示的树上运行这段代码，其中树的分支都用圆形表示，值在中心，叶子用正方形表示。
But suppose we were to run this code on the tree shown in Figure 1, where the branches are represented as circles, with their values in the center, and the leaves are represented as squares.
根目录是这个树的根，由前向斜杠 (/)表示。每个子目录都是树的分支。
The root directory, denoted by a forward slash (/), is at the base of this tree, and each subdirectory off of the root is a branch of the tree.
当您只想从目录树的一个分支跳转到附近的另一个分支时，使用绝对路径会有点麻烦，这就是cd命令允许使用相对路径的原因。
It's a bit cumbersome using absolute paths when you only want to jump from one branch of the tree to another nearby. That's why CD allows you to use relative paths.
由于这种类型的增长，他们通常有接近顶部的树很少，如果除了任何分支机构。
Because of this type of growth they usually have few, if any, branches except near the top of the tree.
一颗有树干和许多分支的树。
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.
应用推荐