<![CDATA[This study applies graph theory to model the Trans Metro Deli network and determine the minimum weighted path using Dijkstra's Algorithm. The transportation network is represented as a weighted directed graph G=(V,E), where vertices represent bus stops, edges represent direct connections between bus stops, and the weight w(u,v) represents the estimated travel time in minutes. Data was obtained from BusListrikMedan and Google Maps, then implemented using Python with the NetworkX library. The modeling results produce a weighted directed graph consisting of 236 vertices and 245 edges representing the five main corridors of Trans Metro Deli. Tests were conducted on five travel scenarios to analyze the path with the minimum total weight. The results show that Dijkstra's Algorithm successfully determines the minimum weighted path in all test scenarios. The smallest minimum weight was obtained on the Amplas Terminal Bus Stop–Juanda Bus Stop route at 22 minutes, while the largest minimum weight was obtained on the Bandar Khalipah Station Bus Stop–Pinang Baris Terminal Bus Stop route at 73 minutes. Validation against Google Maps resulted in a time difference of 2–4 minutes, which indicates that the graph model built is able to represent the connectivity of the Trans Metro Deli network well.]]>
Copyrights © 2026
