Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal IJID (International Journal on Informatics for Development)
Tri Setya Dermawan
Magister of Informatics State Islamic University Sunan Kalijaga Yogyakarta
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train Tri Setya Dermawan
IJID (International Journal on Informatics for Development) Vol. 7 No. 2 (2018): IJID December
Publisher : Faculty of Science and Technology, UIN Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (804.05 KB) | DOI: 10.14421/ijid.2018.07202

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.
Co-Authors