1) shortest path counting problem
数最短路
1.
The shortest path counting problem is applied in many aspects of societies.
数最短路问题在社会生活中有着广泛的应用 。
2.
The shortest path counting problem is applied in many aspects in societies.
数最短路问题 (SPCP)在社会生活中有着广泛的应用 。
2) number of the shortest roads
最短路线数
3) the parametric shortest path
含参数的最短路
1.
Given a network G λ=(V,E) with a parameter λ, we use the Primal-Dual algorithm to solve the parametric shortest path problem from some vertex s to another in digraph G λ.
对于含参数的网络图Gλ=(V ,E) ,本文用原始 -对偶算法求解Gλ 中自某一节点s到其它任意节点之间含参数的最短路 ,其时间复杂度为 0 (nm2 )。
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.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条