| GIS领域最短路径算法的改进与实现 |
| |
| 引用本文： | 张池军,王菲. GIS领域最短路径算法的改进与实现[J]. 吉林工学院学报, 2009, 30(1) |
| |
| 作者姓名： | 张池军 王菲 |
| |
| 作者单位： | 张池军,ZHANG Chi-jun(长春税务学院,信息系,吉林,长春,130117);王菲,WANG Fei(吉林省隆源供水集团有限公司,吉林,四平,136000) |
| |
| 摘 要： | 在Dijkstra改进算法中,提出了在弧的权值中加入路径惩罚因子,解决了光纤专线路由选择对节点的数目限制问题.在光纤网络路由优化实际测试中, 取得了较为满意的效果.
|
| 关 键 词： | 最短路径 算法 路径依赖 |
An improved algorithm to get the shortest path in GIS field |
| |
| ZHANG Chi-jun,WANG Fei. An improved algorithm to get the shortest path in GIS field[J]. Journal of Jilin Institute of Technology, 2009, 30(1) |
| |
| Authors: | ZHANG Chi-jun WANG Fei |
| |
| Affiliation: | 1.Department of Information;Changchun Taxation College;Changchun 130117;China;2.Siping City Longyuan Water Supply Co.Ltd;Siping 136000;China |
| |
| Abstract: | The path punishment factors are added to the weight of arcs in the improved Dijkstra algorithm to solve the problem that the numbers of node in special fiber transmision are limited.In the experiment of fiber-optic network optimization,good results are obtained. |
| |
| Keywords: | GIS Dijkstra |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
