IMPLEMENTATION OF DIJKSTRA'S ALGORITHM IN DETERMINING THE SHORTEST PATH (CASE STUDY: SPECIALIST DOCTOR SEARCH IN BANDAR LAMPUNG)
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...
Main Authors: | Rakhmat Dedi Gunawan, Riduwan Napianto, Rohmat Indra Borman, Irma Hanifah |
---|---|
Format: | Article |
Language: | English |
Published: |
STMIK Pringsewu
2019-12-01
|
Series: | IJISCS (International Journal of Information System and Computer Science) |
Online Access: | http://ojs.stmikpringsewu.ac.id/index.php/ijiscs/article/view/768 |
Similar Items
-
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
by: Nur Syuhada Muhammat Pazil, et al.
Published: (2020-11-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Shortest Path Search Futsal Field Location With Dijkstra Algorithm
by: Delpiah Wahyuningsih, et al.
Published: (2018-07-01)