IMPLEMENTASI ALGORITMA DIJKSTRA DALAM MENENTUKAN RUTE TERPENDEK BIS TRANSJAKARTA DALAM MENGUNJUNGI 5 DESTINASI WISATA POPULER DI JAKARTA
| Main Authors: | TAPOBALI, PATRICIA JOSEPHINE BAREK BABA, KRISNAMURTI, CYRENIA NOVELLA |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University
, 2020
|
| Online Access: |
https://ojs.unud.ac.id/index.php/mtk/article/view/57767 https://ojs.unud.ac.id/index.php/mtk/article/view/57767/37391 |
Daftar Isi:
- This study shows the Dijkstra Algorithm process in determining the shortest Transjakarta bus route connecting 5 popular tourist destinations in Jakarta, namely; Ragunan Wildlife Park, Beautiful Indonesia Miniature Park, National Monument, Old Town, and Ancol Dreamland. Based on the analysis of the data obtained by the 5 shortest routes in visiting 5 popular tourist destinations in Jakarta with the initial position is a different tourist destination, namely; (1) TMII ? Monas ? City ? Ancol ? Ragunan with the length of the Transjakarta bus lane is 57.6 kilometers. (2) Ragunan ? Monas ? City ? Ancol ? TMII with the length of the Transjakarta bus lane is 47.38 kilometers. (3) Monas ? City ? Ancol ? Ragunan ? TMII with the length of the Transjakarta bus lane is 53.86 kilometers. (4) City ? Ancol ? Monas ? Ragunan ? TMII with the length of the Transjakarta bus lane is 49.46 kilometers. (5) Ancol ? City ? Monas ? Ragunan ? TMII with the length of the Transjakarta bus lane is 46.41 kilometers.