Dijkstra's Algorithm to Find Shortest Path of Tourist Destination in Bali

15Citations
Citations of this article
87Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Bali is one of many small island in Indonesia and referred as "The Island of Gods". Bali has varieties of tourist destination e.g. art villages, ecotourism, historical building, spiritual tourism and temples. Dijkstra's algorithm is an algorithm that used to be solution in finding shortest path problem. It can be use to find the shortest route between one tourist destination and all other tourist destinations. Hence, we use dijkstra's algorithm to find shortest path of tourist destination in Bali. There are top ten tourist destinations that has been used in this paper Tanah Lot, Uluwatu, Ulun Danu Beratan, Kebun Raya Eka Karya, Penelokan Batur, Tirta Empul, Taman Ayun, Bali Safari and Marine Park, Goa Gajah and Bali Zoo Park.

Cite

CITATION STYLE

APA

Fitriansyah, A., Parwati, N. W., Wardhani, D. R., & Kustian, N. (2019). Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali. In Journal of Physics: Conference Series (Vol. 1338). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1338/1/012044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free