Can I read Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali on EtoBox?

Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali by A Fitriansyah; N W Parwati; D R Wardhani; N Kustian is a Physics and Astronomy article available to read on EtoBox.

What is Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali about?

## 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.

Who reads Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bali?

Author

A Fitriansyah; N W Parwati; D R Wardhani; N Kustian

Publisher

Institute of Physics; IOP Publishing (ISSN 1742-6588)

Published

2019

Language

EN

Field

Physics and Astronomy (Physical Sciences)