Searching For The Nearest Route To The Location Of Health Facilities Using The Djikstra Method

Abstract

A health facility or health service facility is a tool or place used to carry out health service efforts, both in terms of promotive, preventive, curative and rehabilitative carried out by the central government, regional government or the community. This research contains development applications that cover every hospital, health center, and practice clinic located in the Langkat Regency area with the aim of facilitating the community in finding the nearest hospital, health center, and practice clinic. The application built can display the location of the health facility in map form and can display information in the form of name, address, telephone number, photo of the health facility, services available there, working hours, and further information on the place. In this study, the search for health facilities is only subject to distance as a health facility criterion, so that it can be developed further. To find the closest route to a health facility, here the author uses the Dijkstra Algorithm method which has been widely researched to be applied to the shortest route search system. This algorithm was invented by Edsger Dijkstra, a computer scientist from the Netherlands. The way Dijkstra's algorithm works is with a greedy strategy, namely at each step it chooses the side with the smallest value that connects the selected and unselected nodes/nodes. This algorithm requires a point of origin and a destination with the final result being the shortest distance from the point of origin to the destination along with the route.