Open AccessDijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali
Author(s) -
Aswin Fitriansyah,
N. W. Parwati,
Dyah Rhetno Wardhani,
Nunu Kustian
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1338/1/012044
Subject(s) - dijkstra's algorithm , tourism , shortest path problem , destinations , tourist destinations , geography , ecotourism , computer science , algorithm , graph , archaeology , theoretical computer science
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.