Penerapan Algoritma Floyd-Warshall dalam Menentukan Rute Terpendek pada Top 10 Wisata Kuliner di Kota Medan

Abstract

The Floyd-Warshall algorithm is an algorithm that can be used to solve shortest route problems. This algorithm works by comparing every possible route in the graph for each pair of nodes produced. This research examines the application of the Floyd-Warshall algorithm in determining the shortest route among the ten most popular culinary tourism destinations in the city of Medan. Culinary tourism in this city offers many interesting choices, but visiting many locations in one trip requires good route planning so that travel time and costs can be minimized. The Floyd-Warshall algorithm is used to solve this problem by carrying out calculations on a weighted graph that represents the distance between culinary tourism points. Distance data between locations is taken from Google Maps and processed using the Floyd-Warshall algorithm to find the shortest route that connects all points. The implementation results show that the Floyd-Warshall algorithm can be used in planning culinary tourism routes and helping tourists and tourism service providers to organize tourist trips. The proposed route generated using the Floyd-Warshall algorithm method produces a closer route with a total distance of 28.6 km.