FINDING SHORTEST PATH BASING ON DIJKSTRA'S ALGORITHM FOR BAGHDAD UNIVERSITIES BY USING GEOGRAPHIC INFORMATION SYSTEM APPLICATIONS
##plugins.themes.bootstrap3.article.main##
Abstract
As the population increases, the transport network becomes difficult and enormous. Finding demanded location is becomes a troublesome task. After finding, a location individual gets confused to access that location because of the routes contains several modes. This drawback is even more substantial for those who may have to go to strange parts of the city. Just in case of the universities, it is troublesome to find the specified university and it's the shortest path to access therefore takes longer to access it. In this paper solved this problem by find the shortest path from the user location to the university or between two universities. The area for study is Baghdad city and the coordinate for universities is obtained from Google earth program. The ArcGIS software system used and also the Dijkstra’s algorithm to produce the shortest path from one location to a different and ArcGIS cloud publisher for publish map from ArcMp to ArcGIS cloud and then can be edited and updated
Downloads
##plugins.themes.bootstrap3.article.details##
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Qalaai Zanist Journal allows the author to retain the copyright in their articles. Articles are instead made available under a Creative Commons license to allow others to freely access, copy and use research provided the author is correctly attributed.
Creative Commons is a licensing scheme that allows authors to license their work so that others may re-use it without having to contact them for permission
