Comparative research on all to all pairs path finding algorithms in a real-world scenario

Computer Science Department, School of Computing and Media, 11480 Bina Nusantara University, Jakarta, Indonesia

^* Corresponding author: seraphina@binus.ac.id

Abstract

This paper presents a comparative study of the implementation of all-to-all pairs shortest path algorithms, specifically Floyd-Warshall, Johnson’s, and Dijkstra’s. It contributes to a better understanding of their strengths and weaknesses in different types of applications (real-world scenarios). The research demonstrates the use of these algorithms in finding the shortest path between multiple locations using a Google Maps plotter and the Google Maps API. Older research papers have shown a comparison that shows that the Floyd-Warshall algorithm is faster than the other two algorithms in certain scenarios; however, none have brought up the real-world application of such an algorithm. The null hypothesis of this study is that the Floyd-Warshall algorithm is not suitable for use in a real-life application for finding the shortest path compared to Johnson’s algorithm. The results of this study have potential applications in transportation and logistics and will provide useful insights for future work in this field.