Dijkstra Algorithm Implementation to Determine the Shortest Route to Hospital: A Case Study in Magelang District Indonesia Febri Kurniawan(a), R Arri Widyanto(b*), Pristi Sukmasetya(a)
(a) Department of Informatics Engineering, (b)Department of Information Technology
Universitas Muhammadiyah Magelang, 56172, Indonesia
Abstract
Digital maps are an important tool used to find a place. The use of digital maps is very diverse, including to provide routes from one place to another. The map can also show that the route to which the traffic is congested so that you can find another route. However, sometimes maps provide ambiguous routes so that users can get lost. This is of course very inconvenient if in an emergency situation to find the location of the nearest hospital.
Determine the shortest route to the nearest hospital so as to save time in an emergency.
The method used in this research is Dijkstra^s algorithm.
Determination of the current location and the shortest route to the nearest hospital.
Maximize map utilization with the shortest route to the nearest hospital.
