dijkstra是什么意思

dijkstra中文什么意思

戴克斯特拉

dijkstra算法: dijkstra's algorithm
edsger dijkstra: 艾兹格迪科斯彻
dijkstal: 戴克斯塔尔
dijl: 戴尔
dijkhuizen: 迪吉克豪岑

下载手机词典可随时随地查词查翻译

例句与用法

We denote many typical arithmetics with apla , such as , non - recursive tree traversals , dijkstra , topological sorting etc . the test result indicates the program transformer can improve the program ' s reliability and development efficiency . it can replace softeware blue collar to complete mechanical and creative work
5 、实现了自动转换系统的泛型问题中的类型参数化问题，解决了apla提供泛型机制，而java语言不支持泛型机制的矛盾。
In the course of the design of trajectory optimization , we adopt the improved adaptive genetic algorithm . first , the route planning problem is converted into the restricted short - cut problem and dijkstra algorithm is used to get the rough optimized trajectory which makes terrain avoidance and threat avoidance effectively . then , the adaptive genetic algorithm is used to optimize the reference trajectory
对于航迹优化问题，采用了改进自适应遗传算法，首先把航迹规划问题转化为受约束的最短路径问题，并采用狄克斯特拉算法得到可以进行地形回避和威胁回避的粗略优化路径，然后利用改进的自适应遗传算法对粗略优化路径进行优化，得到优化航迹。
After analyzed the limitation of dijkstra algorithm and genie algorithm , a pulse coupled neural networks ( pcnn ) algorithm is proposed . pcnn provides group similarity , synchronous exciting and auto - wave generation characters , and is widely researched and applied in image processing , target identification and optimization fields
脉冲耦合神经网络提供了分组类似性、同步激发和自动波的形成与传播等一系列基本的特性，并在图像处理、目标的自动辨识和组合优化等领域中得到了广泛的应用和研究。
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
In the part of upper - layer software , new global path planningalgorithm , which is based on improved dijkstra algorithm and ant system algorithm , is givenin the thesis , and the new algorithm is proved to be valid in simulation , the map representationproblemofspatialandslamproblemformobilerobotare brieflyanalyzed
在上层软件部分,提出了以改进的dijkstra算法和蚁群优化算法为基础的新的全局路径规划算法,并仿真验证了该算法的有效性,初步分析了移动机器人的环境空间地图表示问题和slam问题。