1) local shortest path tree
局部最短路径树
2) shortest path tree
最短路径树
1.
Complete dynamic algorithm for updating shortest path tree;
更新最短路径树的完全动态算法
2.
In order to optimize the cost of the shortest path tree(SPT),a path-driven idea is proposed.
为了对最短路径树SPT(Shortest Path Tree)进行代价优化,提出了路径驱动的思想,主要是生成SPT时通过路径节点共享的方式来优化其总体代价。
3.
The cable trench problem defined as a combinatorial optimization problem which combined by two prob-lems,the shortest path tree problem and the minimum spanning tree problem.
开沟布线问题定义为由最短路径树和最小生成树这两个问题组合而成的组合优化问题,是一个新提出的、易于描述的却难于处理的NP完全问题。
3) shortest path tree routing
最短路径树路由
4) dual shortest path tree
对偶最短路径树
1.
Principles and its prototype algorithm for dual shortest path tree in networks with turning constraints;
转向约束网络中的对偶最短路径树原理及其原型算法
5) Single-source shortest path tree
单源最短路径树
6) most short-path spanning tree
最短路径生成树
补充资料：局部
一部分；非全体：～麻醉 ㄧ～地区有小阵雨。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条