the shortest path
网络释义专业释义
The Shortest-Path Problem 最短路问题
The Shortest -Path 最短路径
the shortest-path 最短路径
the shortest path map 带权图最短路径
Find The Shortest Path 寻找最短路径
the shortest path length 最短路径长度
the shortest path network 最短路网络
finding the shortest path 最短路径查找
-
最短路径 - 引用次数：63
Repeatedly implementing this algorithm a constant times can obtain the shortest path and the length.
反复执行常数次该算法可以求得最短路径及其长度。
参考来源 - 交通道路网中任意两点之间最短路径的快速算法 -
最短路径 - 引用次数：48
The shortest path problem is a core model that lies at the heart of network optimization.
最短路径问题是网络优化的核心技术。
参考来源 - 时变、随机网络最优路径算法及其应用研究
·2,447,543篇论文数据，部分数据来源于NoteExpress
双语例句原声例句权威例句
-
走最短路径。
-
The shortest path is then calculated between these nodes.
最短路径就是各节点连线的最低寻路代价。
-
Here we use the ant colony algorithm to solve the problem to find the shortest path to travel.
这里我们运用蚁群算法对问题进行求解找到最短的旅行路径。
-
End up where you started. It's not quite the same as the shortest path, and figure out the way to do that that involves spending the least money. Or the least time, or something else.
最后回到最初的地方,这和最短路径问题有些不同,需要找出一条花费最少,或者费时最少或者满足其它条件的路径。
-
So if you think about the way something like, say, Mapquest works, and last week in recitation you looked at the fact that shortest path is exponential.
所以如果你想想电子地图，还有上周学的列举法,你就会发现一般最简单的方法,都是指数递增的。
应用推荐