Upon looking at the problem closer, you can see, however, that the depth of the dependency graph tends to be shallow, and furthermore that some objects are natural endpoints.
但是，如果仔细考虑一下这个问题，就会发现依赖图的深度一般不大，而且某些对象是自然的端点。
Db4o compromises by constraining the number of objects retrieved, using what it calls activation depth, which indicates the number of levels down the object graph to be retrieved.
db4o对此采用了折衷的办法，限制所检索的对象数量，使用称为激活深度(activation depth)的方法，它指明在对象图中进行检索的最低层。
It does not provide in-depth, low-level, expert functions to manually examine the entire object graph within the heap.
它并未提供深入、低级的专家功能，即手动检查堆内的整个对象图。
The dotted lines in the graph indicate the flow of information between activities, which is something that I will explain a bit more in depth once I get to the part about creating a WSFL global model.
图中虚线行指出活动间的信息流，这一点我将在创建WSFL全局模型这一部分进行更深入的说明。
Modifications to the depth and breadth of a key graph allow users to define their level of security.
密钥图深度和广度的调整使用户能够确定它们的安全级别。
There are two common approaches to searching a graph: depth-first search and breadth-first search.
有两种常用的方法可以用来搜索图：即深度优先搜索和广度优先搜索。
This analysis would be conducted with support of tables and graph to provide an in depth understand of the report.
他的分析来源于表格和图表，以提供一个可以深入了解的报告。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Moreover, to improve the disparity accuracy, a novel energy function is well designed to restrict the depth-continuity of an image and applied to the Graph Cut algorithm to describe the image feature.
并针对图像的深度连续性约束，定义了一个反映图像自身特征的新能量函数，应用于图割算法，提高了视差计算精度。
Moreover, to improve the disparity accuracy, a novel energy function is well designed to restrict the depth-continuity of an image and applied to the Graph Cut algorithm to describe the image feature.
并针对图像的深度连续性约束，定义了一个反映图像自身特征的新能量函数，应用于图割算法，提高了视差计算精度。
应用推荐