IJISCS | 98 IMPLEMENTATION OF DIJKSTRA'S ALGORITHM IN DETERMINING THE SHORTEST PATH (CASE STUDY: SPECIALIST DOCTOR SEARCH IN BANDAR LAMPUNG) Rakhmat Dedi Gunawan 1 , Riduwan Napianto 2 , Rohmat Indra Borman 3 , Irma Hanifah 4 1,2,3,4 Faculty of Engineering & Computer Science, Universitas Teknokrat Indonesia, Bandar Lampung, Indonesia 1,2,3,4 9-11 Z.A. Pagar Alam Street Kedaton, Bandar Lampung, Indonesia *Corresponding author Email: rohmat_indra@teknokrat.ac.id Abstract The shortest route from a trip will shorten the travel time. Likewise, in the case of the search for specialists. In the search for a specialist the community must come to the health service to ask for specialist information needed. The shortest path is a problem to find the path between two or more vertices in the minimum numbered weighted graph. To make it easier to solve the shortest path problems, a search algorithm is needed. The algorithm that is commonly used in solving problems in finding the shortest path or path is Dijkstra's algorithm. The basic idea of Dijkstra's own algorithm is to find the cost value closest to the destination that functions in a weighted graph. In this study, the Dijkstra algorithm finds the shortest path based on the smallest weight from one point to another, so that it can help provide path choices. Based on the trial of Dijkstra's algorithm, it has the ability to find the shortest path, because in the algorithm each graph is selected the side with the minimum weight that connects a selected node with another node that has not been selected. Keywords: dijkstra, specialist doctor, shortest path 1.0 INTRODUCTION The problem of optimizing search routes for travel that is often encountered in daily life is the search for the shortest path (shortest path). The shortest path problem is one of the most classic algorithm problems in graph theory, which has the goal of finding the shortest path between two or more nodes in a network [1]. This is also the case with the search for specialist doctors. In the search for community specialist doctors must come to the health service to ask for the specialist information needed, but not all health services have certain specialist doctors. In Bandar Lampung, information on the location of health services is very important because there is no mapping of health service locations. Based on data from the Bandar Lampung City BPS in 2015, the number of hospitals in Bandar Lampung was 19 with 229 specialist doctors. The closest travel route is needed to find a specialist doctor because fast handling will affect the patient's safety and health. The shortest path (shortest path) is a problem to find the path between two or more vertices in a weighted graph whose combined side weight of the graph being traversed is the minimum [2]. To make it easier to solve the shortest path problem, a search algorithm is needed. The algorithm is a sequence of problem solving that is arranged systematically and logically to solve a problem [3]. The algorithm that is commonly used in solving problems of finding the path or shortest path is the Dijkstra algorithm. Dijkstra's algorithm solves the problem of finding the shortest path between two vertices in a weighted graph with the smallest total number, by Full Paper eISSN : 2598-246x pISSN : 2598-0793 International Journal Information System and Computer Science (IJISCS)