PERBANDINGAN ALGORITMA DJIKSTRA DAN WARSHALL DALAM PENENTUAN LINTASAN TERPENDEK KE KOTA KLATEN
Abstract
Search for the shortest path is a problem that is faced when we want to travel or go somewhere. Klaten City is one of the cities in Central Java. Cities around Klaten include Boyolali. When we go to Klaten city there are several alternative roads or trails that can be chosen from Boyolali. Mathematically this condition can be applied in graphical form to find the shortest path to the city of Klaten. Determination of the shortest path can be found using the Djikstra Algorithm and the Warshall Algorithm. Researchers tried to compare the two methods to get the most optimal result. From the study concluded that the Djikstra algorithm is more effective than the Warshall algorithm for the shortest path from Boyolali to Klaten.
References
[2] Defindal, Irvan Prama dkk. 2005. Algoritma Greedy untuk Menentukan Lintasan Terpendek. Bandung : ITB
[3] Ferdiansyah & Ahmad Rizal. 2013. Penerapan Algoritma Djikstra untuk Menentukan Rute Terpendek Pembacaan Water Meter Induk PDAM Tirta Kerta Raharja Kabupaten Tangerang. Jurnal TICOM vol 2. No 1 September 2013
[4] Munir. 2005. Diktat kuliah IF2251 strategi algorithm. Bandung
[5] Munir. 2008. Matematika Diskrit. Bandung : Penerbit Informatika
[6] Pradhana, B. A. 2009. Studi dan Implementasi Persoalan Lintasan Terpendek suatu Graf dengan algoritma Djikstra dan Algoritma Bellman-ford.
[7] Sarwoko, E.A. 2003. Perancangan Arsitektuur Pemaralelan untuk Mencari Shortest path dengan Algoritma Djikstra. Jurnal Matematika dan Komputer. 6 : 137-143
[8] Siang, Jong Jek. 2006. Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. Yogyakarta : ANDI
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.