1) all shortest paths
全部最短路
1.
The extending path algorithm of all shortest paths from the original node to the other nodes on network and the algorithm of the minimum shortest path network and tree are presented.
在分析已有最短路问题研究成果的基础上,提出了最小最短路网络的概念,给出了求网络上始点到所有顶点间全部最短路的径路延伸算法以及最小最短路网络、最小最短路树的算法。
2) local shortest path tree
局部最短路径树
3) Shortest Path Assignment (All-or-Nothing )
最短路径分配(全有全无)
4) shortest path
最短路径
1.
Briefly on the shortest path algorithm in the urban road network;
浅析城市道路网中的最短路径算法
2.
The Realization of Shortest Path Algorithm in Traffic System;
最短路径搜索算法在交通系统上的应用
3.
Study on the multi-modal shortest path in time-varying network;
时变网络下多式联运的最短路径问题研究
5) shortcut
[英]['ʃɔ:tkʌt] [美]['ʃɔrt,kʌt]
最短路径
1.
Cause analysis of improvedalgorithm of shortcut onselecting the favorite line;
浅析航线选择中的改进最短路径算法
2.
The Improved Shortcut Algorithm and It s Application in Selecting Ship s Optimum Route;
改进最短路径算法在最佳航线选择中的应用
3.
An applied algorithm of searching shortcut quickly;
一种实用的最短路径求解算法
6) shortest route
最短路径
1.
Use Dynamic Programming Theories to Search the Shortest Route in the Transportation;
在交通运输上使用动态规划求解最短路径
2.
Sector Dijkstra algorithm for shortest routes between customers in complex road networks
复杂路网下多客户间最短路径的扇面Dijkstra算法
3.
Optimization strategies of the Dijkstra's shortest route algorithm
Dijkstra最短路径算法优化策略
补充资料：全部
1.整个部类。 2.完全。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条