Shortest Route Search for Tourist Attractions in Bandung Using Dijkstra's Algorithm

Authors

  • Yuliani SY. Istambul, Ucu Nugraha Informatic Engineering , Widyatama University Author

DOI:

https://doi.org/10.61841/d5g0fe50

Keywords:

Graph, Javascript, Dijkstra, Tourism

Abstract

Dijkstra's algorithm is one of the algorithms that can solve the problem of finding the shortest route which is a problem in graph theory. Implementation of the system that we use will result in a website application that uses the Javascript programming language. This system uses the Dijkstra algorithm which is very useful for visitors because tourists can find the shortest route that can be taken to and from a tourist destination in the area of Bandung that you want to visit using this system. With the research of the shortest route using the Djikstra algorithm to find the fastest route of tourist attractions in the city of Bandung, the tourists can add information about the fastest route and finally the tourists can choose the best route that can streamline all costs and find out all the information on tourist objects in This city of Bandung. 

Downloads

Download data is not yet available.

References

1.https://www.academia.edu/35442124/PENCARIAN_RUTE_TERPENDEK_ANGKUTAN_UMUM_MENGGUNAKAN_ALGORITMA_DIJKSTRA_BERBASIS_WEBGIS_STUDI_KASUS_DINAS_PERHUBUNGAN_KOTA_BA TAM

2. http://jurnalti.polinema.ac.id/index.php/SIAP/article/view/239

3. http://j-ptiik.ub.ac.id/index.php/j-ptiik/article/download/647/254/

4.https://www.researchgate.net/publication/320184002_PENERAPAN_METODE_DIJKSTRA_PADA_SISTEM_INFORMASI_GEOGRAFIS_SEKOLAH_LUAR_BIASA_DI_KOTA_MEDAN_BERBASIS_ONLINE

5. https://www.neliti.com/publications/67157/implementasi-algoritma-dijkstra-dalam-penentuan-jalur-terpendek-diyogyakarta-me

Downloads

Published

29.02.2020

Issue

Vol. 24 No. 1 (2020): 24 (1) 2020

Section

Articles

License

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. 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.
  2. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .

No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

How to Cite

SY., Y. (2020). Shortest Route Search for Tourist Attractions in Bandung Using Dijkstra’s Algorithm. International Journal of Psychosocial Rehabilitation, 24(1), 2340-2345. https://doi.org/10.61841/d5g0fe50