Application Of The Dijkstra Algorithm To Determine The Shortest Route From City Center Surabaya To Historical Places
Abstract
Abstract
Historic places are places that are often visited by local residents and even tourists from outside the city and abroad. Historic places are places that must be visited by tourists from outside the area, but there are problems that often occur when they want to visit the destinations of this historic place. The problem is the route from each historical site location itself and also the ignorance of the shortest and fastest routes that are more efficient. This study aims to determine the shortest route that will use Dijkstra's Algorithm as a research method. This research will be accompanied by determining which points will be passed so that they can get the shortest route so as to reduce driving time. It will also be accompanied by how to use Dijkstra's Algorithm in finding the shortest route for the location of this historic place. The results obtained from this study there are 4 shortest routes that can be taken to get to historical places through the starting point Gubeng Station.
Downloads
Copyright (c) 2022 Jurnal Teknologi Dan Sistem Informasi Bisnis - JTEKSIS
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under an Attribution 4.0 International (CC BY 4.0) that allows others to share — copy and redistribute the material in any medium or format and adapt — remix, transform, and build upon the material for any purpose, even commercially with an acknowledgment of the work's authorship and initial publication in this journal.
