Implementasi Algoritma Djikstra dalam Menentukan Rute Terpendek Jalan Antar Kota di Wilayah Jawa Timur Berbasis Website

Abstract

This study focuses on the development of a shortest route determination system for inter-city travel in East Java, utilizing the Dijkstra algorithm. The introduction provides an overview of East Java as the largest province in terms of area and its extensive road infrastructure. The method section explains the implementation process, starting with the collection of node and edge data from Google Maps, followed by the digitization of maps and transformation of the graph into JSON format. The Dijkstra algorithm is then applied to calculate the shortest routes. The analysis highlights the challenges faced by travelers due to multiple route options and road closures, emphasizing the need for an efficient system. The results demonstrate that the developed system accurately determines the shortest routes between cities in East Java, utilizing the graph representation. The conclusion emphasizes the significance of the Dijkstra algorithm in supporting the development of the shortest route determination system. The system, built as a website-based application using the waterfall SDLC and JavaScript programming language with the React Js framework, offers users features such as homepage access, search functionality for the shortest routes, and visualization of results using the Google Maps API. The system contributes to optimizing travel routes and providing information on road conditions, enhancing the overall travel experience in East Java.