Abstract
The Toba Regency Government focuses on developing the tourism sector, because the natural resources in Toba Regency have great potential. The purpose of this research is to determine the shortest route to an effective tourist spot and the time it takes to cover that distance. The method used to determine the shortest route is the Dijkstra and Floyd - Warshall Algorithms. Dijkstra's algorithm aims to choose the best solution from each set of solutions, while the Floyd-Warshall algorithm compares all possible paths on the graph for each vertex. Based on the research results, the shortest route for 24 tourist attractions in Toba produces the same route using both algorithms and a weighted graph is obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
