Abstract
This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. The results of these two algorithms are compared using four parameters: time complexity, memory complexity, level of completion and level of optimization. Based on our experiments, Dijkstra algorithm has better performances on those four parameters than Floyd-Warshall algorithm.
References
Andiany, F.E, and Hadikurniawati, W., “Implementasi Algoritma Dijkstra untuk Mencari Rute Terpendek Antar Kantor dan Estimasi Penggunaan Bahan Bakar Kendaraan (Studi kasusu PT. Telkom Indonesia Regional IV Jateng-DIY”, Proceeding of SENDI_U, 2018.
Javaid, M.A., “Understanding Dijkstra’s Algorithm,” SSRN Electronic Journal, 2013.
Siang, J. J., Matematika Diskrit dan Aplikasinya pada Ilmu Komputer. 4nd ed. Yogyakarta: ANDI, 2009.
Alam, Md. A., Faruq, Md. O., “Finding shortest path for road network using Dijkstra’s algorithm,” Bangladesh Journal of Multidisciplinary Scientific Research, vol. I, no. 2, 2019
Kriswanto, dkk., “Penentuan jarak terpendek rute transmusi dengan algoritma Floyd-Warshall,” Proc. of Seminar Nasional Teknologi Informasi & Komunikasi Terapan (SEMANTIK), Yogyakarta, 2014.
IJID (International Journal on Informatics for Development) is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License