Full Lenght Article
Finding the Shortest Route for Kosovo Cities Through Dijkstra's Algorithm

Under a Creative Commons license
Open Access

Abstract

Kosovo is a beautiful country with a strong cultural heritage which has a very rich nature. Kosovo is not only mountainous, but also has scenic views and other attractions of high cultural importance. Although a small country, Kosovo has many destinations to see and visit. Therefore, to visit these cities we try to choose the shortest route between these locations. But this is probably very difficult to do manually. For this reason, the purpose of this study is to find the shortest path between the two cities of the Republic of Kosovo through Dijkstra’s algorithm. The mentioned cities are in both ends of the country, where the starting point is the city of Gjakova and the destination is the city of Gjilan. Dijkstra's Algorithm basically starts at the node that you choose and it analyzes the graph to find the shortest path between that node and all the other nodes in the graph. The results of this study showed the importance of Dijkstra's Algorithm, where by measuring the road distance through Google Maps, we came to the conclusion in calculating the shortest route between these cities.

Keywords

Dijkstra's Algorithm
graphs
Kosovo
node
shortest path

Declarations

Conflict of Interest Statement

The author (s) declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Downloads

Download data is not yet available.

References

[1] N. Tyagi, Dijkstra’s Algorithm: The Shortest Path Algorithm, Analytic Steps, 2020. https://www.analyticssteps.com/blogs/dijkstras-algorithm-shortest-path-algorithm.

[2] S. Catherine, Dijkstra's Shortest Path Algorithm: Overview and Examples, Study.com, 2003. www.classroom.google.com/?authuser=0.

[3] T. Wai dhe H. Thaung, Shortest-Path Finding System using Dijkstra’s Algorithm, University of Computer Studies, Maubin, Myanmar, 2020.

[4] Z. Fuhao dhe L. Jiping , An algorithm of shortest path based on dijkstra for huge data, International Conference on Fuzzy Systems and Knowledge Discovery, 2009. FSKD ’09, 4, 244-247, 2009.

[5] K. Mehlhorn dhe P. Sanders, Algorithms and Data Structures: The Basic Toolbox., Springer. doi:10.1007/978-3-540-77978-0, 2008.

[6] E. C. Navone, «Learn to Code,» Free Code Camp, 2022. https://www.freecodecamp.org/news/dijkstras-shortest-path-algorithm-visual-introduction/.

[7] Lumen, «Graph Theory,» Mathematics for the Liberal Arts, 2022. https://courses.lumenlearning.com/waymakermath4libarts/chapter/shortest-path/.

[8] M. Pandey, Dijkstra Algorithm, Scalet Topics, 20 12 2021. https://www.scaler.com/topics/data-structures/dijkstra-algorithm/.

Bibliographic Information

Verify authenticity via CrossMark

Cite this article as:

Orhani, S. (2022). Finding the Shortest Route for Kosovo Cities Through Dijkstra’s Algorithm. Middle European Scientific Bulletin, 25, 247-254. Retrieved from https://cejsr.academicjournal.io/index.php/journal/article/view/1360
  • Submitted
    13 June 2022
  • Revised
    13 June 2022
  • Published
    21 June 2022