PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN JALUR TERBAIK PADA SEBUAH PERJALANAN KERETA API DI WILAYAH JAWA

TRI SETYA DARMAWAN, NIM. 13650049 (2018) PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN JALUR TERBAIK PADA SEBUAH PERJALANAN KERETA API DI WILAYAH JAWA. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN JALUR TERBAIK PADA SEBUAH PERJALANAN KERETA API DI WILAYAH JAWA)
13650049_BAB I, V_DAFTAR PUSTAKA.pdf - Published Version

Download (2MB) | Preview
[img] Text (PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN JALUR TERBAIK PADA SEBUAH PERJALANAN KERETA API DI WILAYAH JAWA)
13650049_BAB II, III, IV.pdf - Published Version
Restricted to Registered Academicians of UIN Sunan Kalijaga Only

Download (2MB)

Abstract

A train trip is needed for the best route. The best route is the path found based on the minimum price of a train journey using the Dijkstra and Floyd-Warshall algorithms. This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The results of route discovery will be displayed in a web-based application using the PHP programming language and MySQL database. In finding the path, this study uses two algorithms from some of the shortest algorithm search algorithms, Dijkstra and Floyd-Warshall algorithm. The results of these two algorithms are compared using 4 parameters: time complexity, memory complexity, level of completion and level of optimization. Based on the comparison results from the implementation of Dijkstra and Floyd-Warshall algorithms, it can be concluded that Dijkstra's algorithm has a time complexity of 81 or 88.89% faster than the Floyd-Warshall algorithm. For the memory complexity, it can be concluded that Dijkstra's algorithm uses a memory of 512616 bytes or 46.04% less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes or 48.81% less than the Floyd-Warshall algorithm. For the level of completion of the two algorithms, there is no error. In addition, for the level of optimization the Dijkstra algorithm has advantages in this study, namely the data used is dynamic or variable data in each stage of the process.

Item Type: Thesis (Skripsi)
Additional Information / Pembimbing: Rahmat Hidayat, S.Kom., M.Cs.,
Uncontrolled Keywords: Kereta Api, Pencarian Rute Terbaik, Algoritma Dijkstra dan Floyd-Warshall.
Subjects: Tehnik Informatika
Divisions: Fakultas Sains dan Teknologi > Teknik Informatika (S1)
Depositing User / Editor: H. Zaenal Arifin, S.Sos.I., S.IPI.
Date Deposited: 21 Mar 2019 03:04
Last Modified: 21 Mar 2019 03:04
URI: http://digilib.uin-suka.ac.id/id/eprint/33995

Actions (login required)

View Item View Item