dijkstra算法的英文

• dijkstra's algorithm

• 算法    algorithm
• dijkstra    戴克斯特拉
• edsger dijkstra    艾兹格迪科斯彻
• 算法    algorithm◇算法语句 algorithmic statement; 算法语言 algorithmic language (algol)
• 演算法 [算法    algorithm
• boor算法    de boor's algorithm
• casteljau算法    de casteljau's algorithm
• cyk算法    cyk algorithm
• dfs算法    dfs algorithm
• d算法    d algorithm; d-algorithm
• knuthmorrispratt算法    knuthmorrispratt algorithm
• minimax算法    minimax
• paxos算法    paxos algorithm
• rsa算法    rsa
• zip (算法)    zip (file format)
• 笔算法    long hand method; longhand method
• 倒算法    retrograde method
• 反算法    back-calculation
• 估算法    approximation method
• 换算法    barter; conversion
• 积算法    integration method
• 计算法    accounting method; added weight method; algorthmic method; approach; calculative method; calculus; computational method; computational technique; installation; method of calculation; numeration
• 简算法    contracted calculation
• 阶算法    order algorithm
• 精算法    actuarial method

• 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问题。
• Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map , such as map zoonu pan , and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp . , java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data , efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso
  本系统利用mapinfomapxtremeforjava作为地图服务器，采用jsp和java技术，实现了基于webgis的电子地图的缩放、漫游等基本功能，并具有丰富的图文定位查询功能；实现线路路由、缓冲区分析等辅助决策功能；构建了道路管线网络拓扑数据的存储模型，有效地解决了基于webgis的网络拓扑数据的维护问题；对dijkstra算法进行了一些改进，实现了基于webgis的最短路径算法；本系统提供了电子地图数据库接口，使本系统具有很好的开放性和通用性； webgis系统软件具有完善的在线帮助和用户交流论坛，人机界面友好。
• By analyzing the normal parallel method and comparing parallel routing table computation based warr and jesper ' s parallel dijkstra algorithm , propose a scheme of distributed implementation of ospf protocol . secondly , based on the warr , we propose a wholely distributed implementation method of ospf
  分析了可扩展tbit路由器结构的特点以及分布式系统协议并行的一般方法，并对基于warr方法的并行路由表计算和jesper的并行dijkstra算法进行比较，选取加速ospf协议路由表计算的方法。
• Second , dijkstra algorithms is discussed and improved on this paper as a result , d * algorithms is proposed in order to meet qos requests , in which dijkstra is repeatedly employed to successively eliminate those undesired nodes and links and simplify the network . thus , d can improve the convergence of the algorithms
  其次讨论了dijkstra算法，并对此算法进行了改进，提出了d ~ *算法，即为满足qos请求的需要，多次运用dijkstra算法，在网络中依次删除不满足要求的结点及链路，逐渐简化网络，从而达到提高算法收敛性的目的。
• Firstly , according to our study on the psychology of travelers , we build the passenger - route - select model with the purpose of " least change firstly , shortest distance secondly " , propose the question of bus route aggregation and the n shortest paths algorithm combining dijkstra algorithm and moore - pape " s chain table management technology , which is proved valid
  首先在对乘客出行心理研究基础上，提出了“以换乘次数最少为第一目标，距离最短为第二目标”的公交乘客出行路径选择模型和公交路径集问题以及结合dijkstra算法和moore ? pape算法链表管理技术的n条最短路径算法，系统的运行结果验证了该算法的有效性。
• The algorithms cannot meet the requirements above , for its intrinsic quality or reality difficulties . at the beginning of this paper , the structure , workflow , and development condition of global traffic flow guidance system are introduced . then the route optimization choice algorithms classification and structure are summarized
  本文首先介绍了国内外交通诱导系统的发展情况和交通诱导系统的结构、分类和系统的工作流程，接着总结了各种最优路径选择算法的分类方法和分类体系，分析了dijkstra算法和遗传算法在交通路径寻优计算中的不足。