Implementasi Algoritma Dijkstra Untuk Penentuan Rute Terpendek Puskesmas di Samarinda

Abstract

Puskesmas is community health centers are health service facilities that carry out public health efforts and first-level individual health efforts, with prioritizing promotive and preventive efforts, in order to achieve the highest degree of public health in their working areas. Many people have been greatly helped by the existence of puskesmas in the big city or village. However, sometimes the immigrant communities or tourist who visit do not know for sure where the closest Puskesmas is. Therefore, this research is expected to help the community to find out the fastest route to the Puskesmas in the city of Samarinda. The method used is the Dijkstra's Algorithm, which is one of the algorithms that can be used to determine the total shortest path in solving a problem so that it can provide an optimal solution. There are 17 Puskesmas in the city of Samarinda whose distance is calculated in this study, which means that there are 17 points described using the alphabet, namely A to Q to determine the shortest path. From the calculation results of Dijkstra's Algorithm, it can be determined that the shortest route from starting point A is Puskesmas Loa Bakung to point Q is Puskesmas Sambutan in Samarinda is 14 km with the A-B-F-I-K-L-N-O-Q route.