Implementasi Algoritma Floyd Warshall dalam Mencari Jarak Terpendek Rumah Sakit di Kota Medan

Abstract

Hospitals play a crucial role in providing healthcare services to the community, especially in large cities like Medan. This research aims to address an important issue in hospital selection, which is finding the shortest distance from the user's location to the nearest hospital, particularly in emergency situations. The Floyd Warshall algorithm was chosen as the primary method in this study to find the shortest distance between hospitals in the city of Medan. The implementation of the research uses the Python programming language and a desktop application. The main objective of this research is to provide a practical solution for users to find the nearest hospital and serve as a reference for further research in the same field. Through analysis, system implementation, and testing, this research concludes that the Floyd Warshall algorithm successfully finds the shortest distance between hospitals in the city of Medan, with accurate results and good time efficiency. Additionally, this research demonstrates that the algorithm can be adapted for various cities or networks with minor adjustments to input data, showing broad flexibility and scalability. The implications of this research are increased accessibility and effectiveness of healthcare services, as well as the potential for use in route management and emergency response in various contexts.