摘要
根据城市交通路网建设的实际 ,研究了描述城市交通网络图的城市道路数据库的组织结构 ,在此数据结构的基础上依靠 GIS技术的支持 ,采集了大量具体道路信息 ,采用 Dijkstra算法实现了快速最短路径搜索。根据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻 ,给出了一个搜索实例——一个包含 6 1个交通路口的最短路径搜索结果的搜索时间约为 1.
The organization structure of city road database of city communication network map is studied according to the condition of city communication network construction.Based on the database structure and the support of GIS technology,a great deal of specific road information is collected and fast and shortest path search is realized with Dijkstra algorithm.The city traffic condition sets the different weighted value for the edges of traffic network map ,by this way,the optimal path search can be realized.A search example is given which includes the shortest searching time result of 61 crossings is 1.1s.
出处
《电脑开发与应用》
2005年第1期14-15,21,共3页
Computer Development & Applications
基金
山西省科委攻关项目 (基于虚拟仪器设备的研制 )资助
