dijkstra算法 meaning in Chinese
dijkstra's algorithm
Examples
- 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算法和遗传算法在交通路径寻优计算中的不足。