Analysis of the Dijkstra Algorithm in Determining The Shortest Route to Tour the Beaches of Nias Island

The Dijkstra Algorithm is one of the algorithms suitable for addressing the problem of finding the shortest distance. The objective of this research is to improve the optimization of travel routes to tourist destinations through the utilization of the Dijkstra Algorithm. The objective is to generate efficient paths for tourists to visit all the beaches located on Nias Island. These beaches include Hoya Gunungsitoli Beach, Indah Fofola Beach, Saiti Beach, Indah Tureloto Beach, Toyolawa Beach, Merah Afulu Beach, Sirombu Beach, Ladeha Beach, Sorake Beach, Lagundri Beach, Blessing Beach, and Tello Island Beach. The findings of this research demonstrate that the Dijkstra Algorithm can be applied to obtain alternative paths, presenting the shortest routes for tourists to explore the beaches in the Nias archipelago region. The shortest route accessible to tourists to visit all 12 beach locations from the starting point of Gunungsitoli City to the destination of Tello Island covers a distance of 430.7 kilometres. The optimal route in terms of distance and travel time for tourists to reach a beach location is from the starting point of Gunungsitoli City to Hoya Gunungsitoli Beach, spanning a route distance of 35.84 kilometres and a travel time of 149.89 minutes.