Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

Abstract - 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. 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 that Dijkstra's algorithm has a time complexity of 81 faster than the Floyd-Warshall algorithm. For the memory complexity, Dijkstra's algorithm uses a memory of 512616 bytes less than the Floyd-Warshall algorithm for the executive category. Whereas for the economic category the Dijkstra algorithm uses a memory of 482488 bytes 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.