This site uses cookies. By continuing to use this site you agree to our use of cookies. To find out more, see our Privacy and Cookies policy.
Paper The following article is Open access

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

, , and

Published under licence by IOP Publishing Ltd
, , Citation A Fitriansyah et al 2019 J. Phys.: Conf. Ser. 1338 012044 DOI 10.1088/1742-6596/1338/1/012044

1742-6596/1338/1/012044

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.

Export citation and abstract BibTeX RIS

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Please wait… references are loading.