摘要: 在交通运输过程中,用户经常需要搜索经过多个无序地点后返回起点的最短路径。为此,首先在GIS-T中原有空间数据的基础上,动态地建立了一个两点间最短路径信息库;然后,给出了一个不依赖搜索图、结合路线特点的算法,实现了对所需的最短路径的搜索。
关键词:
交通地理信息系统,
最短路径信息库,
最路径搜索
Abstract: In the procedure of transportation, the user demands searching the shortest path through which he returns the starting after reaching many places without sequence. So an information base of the shortest paths between each two places is created dynamically based on GIS-T’ data. Then making use of the feature of transportation and the information base, an algorithm is given to search the shortest path.
中图分类号:
张新常,杜学东,高自友. GIS-T中途经多地点后返回的最短路径搜索算法[J]. , 2005, 31(16): 225-.
ZHANG Xinchang1, DU Xuedong1,2, GAO Ziyou2. A Shortest Path Searching Algorithm of Returning Starting Past Many Places in GIS-T[J]. , 2005, 31(16): 225-.