Comparison of the Dijkstra’s Algorithm and the Floyd-Warshall’s Algorithm to Determine the Shortest Path between Hospitals in Several Cities in Lampung Province

Abstract

Determining the shortest route from one node to another is a problem we often encounter in everyday life. The routes obtained are intended to minimize costs, travel time or distance. In this study, we compare Dijkstra’s and Floyd-Warshall’s algorithms to determine the shortest route between hospitals in some cities in Lampung Province. The efficiency of the two algorithms in solving this problem is assessed based on the program running time. The results show that both Dijkstra’s algorithm and Floyd-Warshall’s algorithm provide the shortest path in the same distance. However, the running time of the Dijkstra’s algorithm takes less time than Floyd-Warshall’s algorithm.