dijkstra算法的英文

• dijkstra's algorithm

• 算法:    algorithm
• dijkstra:    戴克斯特拉
• edsger dijkstra:    艾兹格迪科斯彻
• 算法:    algorithm◇算法语句 algorithmic statement; 算法语言 algorithmic language (algol)
• 演算法 [算法:    algorithm

例句与用法

1. ( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized . a motorcade - optimized dispatching software is realized . finally , future applications of the urban traffic flow guidance system are discussed
   ( 4 )用dijkstra算法实现了城市中两点间最短路径搜索，在此基础上，实现了基于电子地图的大型车队优化调度及管理的系统软件。
2. The theory and algorithm of shortest path in gis is studied in the dissertation . especially , the traditional dijkstra algorithm and heuristic search algorithm are discussed as well as their own characteristics and conditions
   论文对gis中最短路径理论和实现算法进行了分析和研究，特别是对传统的dijkstra算法和启发式搜索算法a ~ *算法进行了详细的探讨，并说明了各自的特点及适用条件。
3. ( 5 ) this thesis analyzes the path plan algorithms for vehicle location and navigation system . dijkstra algorithm is used to calculate the shortest path . at last some notable problems of optimum method and path plan in gis environments are proposed
   ( 5 )对路径规划算法进行了分析，用dijkstra算法实现了最优路径的计算；提出了在gis环境下的优化方法以及路径规划过程中需要注意的问题。
4. At the end of this paper , the different results of pcnn algorithm and dijkstra algorithm is compared , the reason of the difference is analyzed under their internal mechanism , then the conclusion of pcnn has more advantages is drawn
   最后，本文还通过计算实例将脉冲耦合神经网络算法与dijkstra算法的结果进行了比较，从算法思想上探讨了计算结果不同的原因，说明了pcnn算法具有一定的优越性。
5. This paper focuses on the following research work : 1 . proposes a genetic algorithm based on matrix encoding for next hop route with load and time delay ; 2 . proposes a genetic algorithm for shortest route via designated node , solves the problem which dijkastra algorithm need two times or more to compute ; 3 . proposes a scheme of dividing populations and dividing time in order to improve the success ratio ; 4 . proposes a network model for directional motion , performs evaluation for mobile ip based on wlan , and concludes some useful results
   提出了解决移动ip中过指定点的路由的遗传算法，解决了dijkstra算法需要分次计算的问题，通过记录遗传算法的叠代结果还可以给出次优解路由； 3引入了分群和分周期的操作策略，对过指点最短路由的遗传算法进行了改进，仿真分析表明使用该遗传算法求解过指定点的路由获得了比inagaki算法更高的成功率； 4