PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN RUTE TERPENDEK STASIUN GUBENG MENUJU WISATA SURABAYA

Abstract

The issue of determining the shortest-path problem has become a common thing to discuss with regard to the way it is solved using graphs. The solution is generally used with the aim of optimizing certain aspects, for example in terms of fuel use and travel time. This solution can be achieved by applying one of the components in the graph, called algorithm. This journal was written to help the public, especially tourists, in providing information related to the most efficient route from the starting point of the station to various tourist destinations in the city of Surabaya with the application of the Dijkstra algorithm and Floyd-Warshall algorithm. The techniques used in the calculations were carried out manually and the help of programs with language C. Through the research, the results obtained by the Dijkstra Algorithm had a higher efficiency in terms of calculations and the complexity of the program. The calculations carried out in the two algorithms show results in the form of the same and correct minimum weight value, as well as information related to the shortest trajectory that can be applied by the community to increase efficiency in traveling in the city of Surabaya. The shortest route obtained in the comparison of the two algorithms is on the journey with the starting point of Gubeng Station to Jalan Taman