Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bandung

Main Article Content

SY.Yuliani, et. al.

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

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
et. al., S. . (2021). Dijkstra’s Algorithm to Find Shortest Path of Tourist Destination in Bandung. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(8), 1163–1168. Retrieved from https://turcomat.org/index.php/turkbilmat/article/view/3011
Section
Research Articles