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

Senad Orhani

doi:10.47494/mesb.v25i.1360

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

(1) Senad Orhani Department of Education, Faculty of Education, University of Prishtina “Hasan Prishtina”, Prishtina, Kosovo
Albania
(*) Corresponding Author

DOI:

https://doi.org/10.47494/mesb.v25i.1360

Keywords:

Dijkstra's Algorithm, graphs, Kosovo, node, shortest path

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.

Downloads

Download data is not yet available.

References

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

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

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

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.

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

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

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

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

View Article

Published

2022-06-21

How to Cite

Orhani, S. (2022). Finding the Shortest Route for Kosovo Cities Through Dijkstra’s Algorithm. Middle European Scientific Bulletin, 25, 247-254. https://doi.org/10.47494/mesb.v25i.1360

Download Citation

Issue

Vol. 25 (2022): June

Section

Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.

The work simultaneously licensed under a Creative Commons Attribution 4.0 International License

You are free to:

Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.

No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.