Time-depth graph 时深图 ; 时深换算法
depth of flow graph [计] 流程图深度
depth isoline graph 厚度等值线图
depth-first graph-search control strategy [计] 深度优先图搜索控制策略
depth-first search of mixed graph 混合图的dfs算法
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.
它并未提供深入、低级的专家功能,即手动检查堆内的整个对象图。
应用推荐