Shortest path algorithms on GIS dataset using
Richard Somalia, Manoj Pandya, Rupesh Punjani, Neeraj Bhargava · 2013
GIS or Geographic Information System has the ability to query and analyze geographic information in a variety of different contexts. .GIS is a technology which is ideally suited for analysis of the market values of properties, since such values are based upon spatial comparisons as well as individual property attributes. It is well known that computing shortest paths over a network is an important task in many network and transportation related analysis. Choosing an adequate algorithm from the numerous algorithms reported in the literature is a critical step in many applications involving real road networks. We are applying a shortest path algorithm on a graph generated from a shape-file's feature of road network with the distance as the weight-age of a graph node and displaying shortest path with its node information in this tool. Index Terms— shortest path algorithms, Geographical information system (GIS), Dijkstra algorithm, shape-file, geotools, graph, maven eclipse —————————— ——————————