原文传递
An Improved Shortest Path Algorithm with Adjacent Node Matrix
| 题名： | An Improved Shortest Path Algorithm with Adjacent Node Matrix |
| 正文语种： | 中文 |
| 作者： | XIE exiang |
| 作者单位： | Three Gorges University; ollege of omputer and Information, Hubei |
| 关键词： | shortest path adjacent node algorithm adjacent edge algorithm Dijkstra Algorithm |
| 摘要： | The shortest path analysis is the most basic function of GIS network analysis.Dijkstra algorithm is widely recognized as a good shortest path algorithm.In this paper, to save storage space and improve computational speed departure, based on the Dijkstra algorithm, we improved the adjacent edge algorithm, and propose adjacent node algorithms, and gives the algorithm implementation of object-oriented. |
| 会议日期： | 201511 |
| 会议举办地点： | 成都 |
| 会议名称： | 2015第二届智能交通国际会议 |
| 出版日期： | 2015-10-31 |
| 母体文献： | 2015第二届智能交通国际会议论文集 |
相关文献
- Research on IO Matrix Estimation Model of Local Network
- Numerical Investigation of Constitutive Equation of Generalized Three-dimensional Kelvin Model
- Learning Traveler's Risk Preference to Travel Time Reliability Using GPS Probe Data
- Truck Trip Assignment to Utah's Truck Routes Using Geographic Information System and Genetic Algorithm
- 交通运输网络能力限制路段分析及扩能优化研究
- Coordinated Control for Path Following of Two-Wheel Independently Actuated Autonomous Ground Vehicle
检索历史
应用推荐
