Dijkstra algorithm to find shortest path of tourist destination in the border area of Indonesia – Timor Leste

Tourist attractions are very popular with today’s society, especially on weekends and holidays. This activity aims to enjoy a new environment and take a break from the hectic world for a short time. Many tourist attractions can be found on the island of Timor, particularly in the border areas of the Republic of Indonesia (RI) and Timor Leste (RDTL), particularly in Belu Regency and North Central Timor. The issue is that there is still a lack of information about the locations of tourist attractions in these two districts, as well as the distance to be traveled by tourists from their point of origin to their destination. Seeing this issue, this study created a Geographic Information System (GIS) that can accurately describe the geographical location of a tourist attraction. In this study, a GIS website was created using Dijkstra’s Algorithm, which can assist in determining the shortest distance between the starting point (origin) and the endpoint (destination). As a result of using this algorithm, a tourist can find information about the location of tourist attractions as well as the shortest distance between the starting point of the trip and the endpoint of the trip, namely the destination tourist spot.