A Study and Implementation of Shortest Path Finding in GIS

Geographic Information Systems(GIS),which has been developed since 1960s,has become a mature technology. It is accepted in more and more scopes such as traffic, tour and environment. It is a powerful tool in people’s work and life.Shortest Path Finding is a key content in Network-Analysis of GIS. Optimizing and Implementation the arithmetic of Shortest Path Finding is one of kernel-functions in GIS systems now, especially in traffic GIS and Electricity GIS. So the study of arithmetic of Shortest Path Finding is a hotpot in study and implementation of GIS.The paper chooses mature Dijkstra, analyze time-consume and memory-consume minutely. Base on the data format in ArcGIS, the paper pre-treat the data, choose efficient adjacency multilist, pre-sort the list to quicken the search-process, introduce new structure into the program to keep up the adjacency multilist. The paper implements the arithmetic in ArcGIS Engine Platform, and analyzes the result at last.

Related Posts

You can leave a response, or trackback from your own site.

Leave a Reply

Powered by WordPress | T-Mobile Phones for Sale at BestInCellPhones.com | Thanks to Free Phones at iCellPhoneDeals.com, Free MMORPG Games and Fat burning furnace review