التفاصيل البيبلوغرافية
| العنوان: |
A Computationally Reproducible Approach to Dijkstra’s Shortest Path Algorithm |
| المؤلفون: |
Anbaroğlu, Berk, Özkan, Muammer, Tabakoğlu, Ayça, Uygun, Ekin Gönenç |
| المصدر: |
Advanced Geomatics; Vol. 2 No. 1 (2022); 01-06 ; 2791-8637 |
| بيانات النشر: |
Atlas Akademi |
| سنة النشر: |
2022 |
| مصطلحات موضوعية: |
Shortest path, Routing Algorithms, Dijkstra’s Algorithm, NetworkX |
| الوصف: |
One of the common problems in spatial analysis is the Shortest Path Problem (SPP), which aims to determine the shortest path between any given two points on a network structure. Although Shortest Path Problem is a widely used in spatial analysis, there has been lack of online resources to ease learning of the method with a computationally reproducible approach. This article presents how Dijkstra's algorithm works when finding the shortest path. Specifically, the developed online tutorial relied on the openly available road network data of San Francisco, NetworkX a Python package to realize complex graph analysis, and finally QGIS to visualize the shortest paths. All of the discussed material is presented as a Jupyter Notebook to ease computational reproducibility. |
| نوع الوثيقة: |
article in journal/newspaper |
| وصف الملف: |
application/pdf |
| اللغة: |
English |
| Relation: |
https://publish.mersin.edu.tr/index.php/geomatics/article/view/161/249; https://publish.mersin.edu.tr/index.php/geomatics/article/view/161 |
| الاتاحة: |
https://publish.mersin.edu.tr/index.php/geomatics/article/view/161 |
| Rights: |
Copyright (c) 2022 Advanced Geomatics ; https://creativecommons.org/licenses/by-nc-sa/4.0 |
| رقم الانضمام: |
edsbas.300259BA |
| قاعدة البيانات: |
BASE |