基于MapInfo的Dijkstra最短路径算法研究  

Study on Dijkstra shortest path algorithm based on MapInfo

作　　者：范炯[1] 朱志宇[1] 

机构地区：[1]江苏科技大学电子信息学院,镇江212003

出　　处：《江苏科技大学学报（自然科学版）》2017年第1期79-83,共5页Journal of Jiangsu University of Science and Technology:Natural Science Edition

摘　　要：Map Info平台数据结构简单,不具备空间数据拓扑关系,无法直接分析最优路径.针对上述问题,建立路网模型,通过道路预处理,使用Map Basic语言编程扩展Map Info的功能.在Map Info平台上成功地建立了空间数据的拓扑关系,实现基于Dijkstra矩阵算法最优路径的分析.最后,在路网模型上以图形的形式显示了计算结果,仿真结果与理论验证相符.MapInfo platform has a simple data structure and it does not have spatial data topology relationship,so it can not directly analyze the optimal path. To solve the above problems,road net model is set up. Through the treatment of road net in advance,Map Basic language is used to improve the function of Map Info. Finally we establish spatial data topology relationship successfully on the platform of Map Info and realize the optimal path based on Dijkstra matrix algorithm.

关 键 词：MAPINFO 路网拓扑 MAPBASIC DIJKSTRA 矩阵算法 

分 类 号：P208[天文地球—地图制图学与地理信息工程]