提出了基于最短路径树的拓扑维护算法。
A topology maintenance algorithm based on the shortest path tree is proposed.
建立一个文件路径树，我的逻辑是正确的吗？
它因而适合计算目的结点数较多的最短路径树。
It is suitable to calculate the shortest path tree which has large destination nodes.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
为计算网页可达性，设计了计算到达网页路径的路径树生成算法（PTSA）。
To compute the page accessibility, a Path Tree Spanning Algorithm (PTSA) was introduced.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
此平台采用分布式消息路径选择算法生成消息交换路径树，便于XML消息引擎生成一个队列和路由策略。
The M-Commerce platform USES a message path finding algorithm to create a message queue in XML message engine for routing.
当选择树中的一个节点时，就会生成那个节点的路径，并添加到过滤条件的左侧。
When any node in the tree is selected, a path to that node is generated and added to the left side of the filter condition.
这比向上三个父目录，然后沿目录树向下，或者使用绝对路径要简单得多。
That's much simpler than going up three parent directories, and then heading back down the directory tree or using the absolute path.
如清单1中所示的任何查询都有到指定数据的精确路径，DBMS可以迅速地在均衡树和字节偏移编码中确定它。
Any query such as the one in Listing 1 has a precise path to the specified datum, which a DBMS can quickly determine in balanced trees and byte-offset codings.
甚至可以在xml树的特定路径上定义索引来改善性能。
Indexes can even be defined on particular paths in the XML trees to improve performance.
位置路径用于选择源树中的节点。
每个Web服务路径末端的Compute节点可以使用environment树中一个唯一的部分来提供参考信息。
The compute node at the end of each Web service path would have to use a unique part of the Environment tree for its information.
与以前一样，可以使用xsl： copy- of将整个idn树复制到输出，但是也可在路径表达式中使用该变量而不需要转换成节点集。
You can use XSL: copy-of to copy the whole IDN tree to the output, as before, but you can also use the variable in a path expression without a node-set conversion.
使用相对路径允许您通过遍历目录树，链接到一个您需要的文件，例如。
The use of relative paths allows you to link to a file by walking up and down the tree of directories as needed, for instance.
请注意，SOAP .Body是soap域树中的逻辑路径。
Note that SOAP.Body is a logical path in the SOAP domain tree.
路径位置——返回一个元素，如果不可修改的树中不存在该元素，则返回null。
Path location — Returns an element or null if it doesn't exist in a non-modifiable tree.
DN是一套属性值对，表示穿过X . 500目录信息树的路径。
A DN is a set of attribute-value pairs that represent a path through an X.500 directory information tree. Here is an example.
为了使用相对路径名，文件系统使用一对特殊的符号来表示在文件树中的相对位置。
To do this, it uses a couple of special symbols to represent relative positions in the file system tree.
路径位置——如果不存在，则创建指向目标元素的导航路径上的所有祖先元素，并返回可修改树的目标元素。
Path location — Creates all ancestors on the navigation path to a target element if they don't exist and returns the target element for a modifiable tree.
一起飞，这些树蛇就可以看到滑行路径两旁的树，一些就转变方向朝树木飞去。
Once airborne, and thus able to observe trees to the side of their glide-paths, some of the snakes turned towards them.
当您只想从目录树的一个分支跳转到附近的另一个分支时，使用绝对路径会有点麻烦，这就是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.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
树z ippers通常包含从根到树中当前位置的一条路径，另外还有关注节点的子树上下文。
A tree zipper is typically composed of a path from the root to the current location in the tree, plus the subtree context at the focal node.
同时，还推导了机器人路径搜索树网格算法。
The gridding arithmetic of search tree of robotic path is derived.
在路径分解和查询计划选择的过程中，利用查询树中的目标节点来避免中间结果的传递。
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
树阵的几何性虽然是以规则的路径排列，却不与那一丝不茍的标准化建物的任何组件(距)所呼应。
Its geometry, although aligned with the circulation routes, does not respond to any module in the meticulously calibrated building.
本文提出并实现了两种基于快速扩展随机树的路径规划器。
This thesis presents two path planner based on the RRTs and has realized them.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
应用推荐