The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Data structure in GIS has been studied, thoughts of various kinds of shortest patch algorithm, its applied data structure and features of various kinds of data structure have been analyzed in this paper; development of shortest path algorithm in real time and parallel has been discussed, spatial distribution features of GIS have been studied, shortages of traditional shortest path algorithm in this specific application have been analyzed by combining the specific situation of seeking for the shortest path in GIS road traffic, one improvement algorithm which makes full use of the spatial distribution characteristics in GIS has been proposed and one new search idea, which is direction first search has been proposed for the path search of traditional Dijkstra algorithm. Finally, the improved algorithm has been realized through programming and the validity of this algorithm has been verified through experiment.

Keywords

Shortest Path, Geographic Information System, GIS, Dijkstra Algorithm.
User
Notifications
Font Size