Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bandung
Main Article Content
Abstract
Bandung is one of the many islands in Indonesia and is known as the “City of Flowers”. Bandung has a variety of tourist destinations eg. The Asian-African Museum, Alun Alun Kota, Puncak Dago, and many other tours in the area around Lembang 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
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.