Application of shortest path algorithms in OSM. Case study-Prishtina
Session
Computer Science and Communication Engineering
Description
In this paper, in addition to the necessary theoretical review of graph theory, we will in particular discuss shortest path algorithms and their implementation. In the second part, we will implement these algorithms on the data exported from OpenStreetMaps in a programming language. OpenStreetMaps (OSM) is an interactive free world map. In the case study of this paper, our goal is to load the road network of Pristina into a graphical programming language structure and implement the algorithms for finding the shortest path and finding the optimal route between two selected points.
Keywords:
graph, shortest path, algorithm, OSM, Prishtina, programming language
Proceedings Editor
Edmond Hajrizi
ISBN
978-9951-550-50-5
Location
UBT Kampus, Lipjan
Start Date
29-10-2022 12:00 AM
End Date
30-10-2022 12:00 AM
DOI
10.33107/ubt-ic.2022.267
Recommended Citation
Reqica, Mirlinda; Berisha, Diellza; Imeri, Bukuri; Zekaj, Blinera; and Jusufi, Azir, "Application of shortest path algorithms in OSM. Case study-Prishtina" (2022). UBT International Conference. 275.
https://knowledgecenter.ubt-uni.net/conference/2022/all-events/275
Application of shortest path algorithms in OSM. Case study-Prishtina
UBT Kampus, Lipjan
In this paper, in addition to the necessary theoretical review of graph theory, we will in particular discuss shortest path algorithms and their implementation. In the second part, we will implement these algorithms on the data exported from OpenStreetMaps in a programming language. OpenStreetMaps (OSM) is an interactive free world map. In the case study of this paper, our goal is to load the road network of Pristina into a graphical programming language structure and implement the algorithms for finding the shortest path and finding the optimal route between two selected points.