<![CDATA[Suboptimal route selection within the road network leading to Universitas Muhammadiyah Kotabumi (UMKO) can result in longer and less efficient journeys; therefore, a systematic analysis method is required to determine the shortest path. This study aims to identify the shortest route from Candimas Medical Center (CMC) Kotabumi to UMKO using Dijkstra's algorithm. A quantitative approach was employed, utilizing inter-node distance data obtained through field observations and digital measurements via Google Maps on June 7, 2026. The transportation network was modeled as a weighted graph comprising nine nodes (vertices) and eleven edges, with weights representing the travel distance between nodes in meters. Dijkstra's algorithm was applied to determine the path with the minimum accumulated weight (distance) from the starting node to the destination node. The results indicate that the shortest path is A → B → C → E → H → I, covering a total distance of 7,750 meters. These findings demonstrate that Dijkstra's algorithm can be systematically applied to determine the shortest path within the CMC–UMKO transportation network.]]>
Copyrights © 2026
