Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph.
本文中引进了连通图的森林图，它是树图的推广。
This paper presents a discussion about the nature of tree graph collecting and distributing function and its center.
本文讨论了树图的集散函数和集散中心的性质。
The information distribution, combination, occurring probability and covered relation in the tree graph have been systematically described.
对于树图中信息的分布、组合、出现机率以及覆盖关系，作了系统的论述。
An important part of SDO is to make data manipulation easier. So once a data Graph is constructed, it is important to be able to traverse the tree and to access its elements with the SDO API.
SDO有一个很重要的特点就是使数据操作变得更容易了，因此一旦构造好一个数据图，很重要的一点就是需要使用SDOAPI来遍历树结构，并访问其中的元素。
Applications can also retrieve a single item or a tree (graph) of items from the repository using this service.
应用程序还可以使用此服务从库检索单个项目或项目树(图形)。
A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.
产品类型层次结构是一个严格的树，而类别层次结构则是一个有方向的非循环图表。
Patent Family Tree logic applies the business logic to generate an XML dependency graph for the patent.
专利系谱逻辑应用业务逻辑来生成专利的XML从属关系图。
BPMN is graph based, where as BPEL has a composite structure without transitions that corresponds to a tree.
BPMN是基于图形的，而BPEL是一个没有变迁的树形组合结构。
The Data Object Graph is the hierarchical structure of data. It contains a tree of Data Objects and another structure called the Change Summary (see Figure 4).
数据对象图是一个描述数据的分层结构，它包括一个数据对象树和另一个称作更改摘要 (Change Summary) 的结构（请参阅图 4）。
The XML Infoset is very similar to a tree structure and it is easy to construct a graph that is not a tree (just connect the nodes in such a way so that there is no obvious root node).
XMLInfoset与树结构非常相似，而且易于构造不是树的图(只需以不产生明显的根节点的方式连接节点)。
Using the Filter Pushdown pattern, we would first match a pattern in the graph, then modify the tree at the point of the match. Here's the Filter Pushdown pattern to match.
我们将首先利用FilterPushdown模式来匹配图中的某个模式，随后在匹配的点对树进行修改。
A graph as a data model was chosen for SOAP Section 5 encoding because a tree structure is often too restrictive for doing RPC and the encoding was designed to facilitate RPC.
SOAPSeciton5编码中选择图作为一种数据模型是因为，对于进行RPC而言，树结构常常限制过多，而编码本来就是为了方便rpc而设计的。
A data graph is a collection of tree-structured objects that might be disconnected from the data source.
数据图就是一组可以从数据源中分离出来的树形结构的对象。
A data graph is a collection of tree-structured or graph-structured data objects.
数据图是树形结构或图形结构的数据对象的集合。
First of all, RDF is graph-based, while XML is tree-based.
首先，RDF是基于图的，而XML是基于树的。
Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.
应用它可以方便且有效地求出一个有向图G的有向树多项式。
The ICE tree has a large graph area in the center where you drag in compounds and nodes and connect them together.
ICE树实际上有一个非常大的操作图。当拖动并连接复合节点和节点到ICE树中时，就是在操作图的中心位置。
The computer system security analysis by fault tree and the network system security analysis by attack graph use the security analysis model.
针对计算机系统的安全故障树方法和网络信息系统的攻击图方法应用了这一安全分析建模工作。
Tree Shaker walks the dependency graph, top to bottom, and shakes out unused code like dead needles in a Christmas tree.
摇树优化器从上到下遍历依赖图谱，并且摇掉用不到的代码，这些代码就像是圣诞树中那些死掉的松针一样。
Based on logical topology similar to wavelength graph, the algorithm constructs the multicast tree.
提出的算法基于一种类似于波长图的逻辑拓扑来构造组播树。
A double-starlike tree is a graph with two stars (whose sizes need not be equal) jointed by a path.
两个大小不一定相等的星图由一条路连接而成的图叫做似双星树。
The algorithm makes use of the characteristic of Lagrange relaxation method, and finds multicast tree satisfying constraint by constructing closure graph and making relaxation to this graph.
该算法充分利用拉格朗日松弛方法的特点，通过构建封闭图，对封闭图进行拉格朗日松弛求得满足条件的多播树。
In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.
在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。
Compare the reachable tree and the reachable graph prove that reachable graph is better than reachable tree.
并将可达性图与可达性树进行比较，证明了可达图是较可达树更为有力的一种分析工具。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
Change the graph layout to tree layout or quick clusters layout.
将图形配置变更为树状配置或快速丛集配置。
Change the graph layout to tree layout or quick clusters layout.
将图形配置变更为树状配置或快速丛集配置。
应用推荐