Shortest Path Algorithms for Smart City Emergency Routing: Scalability and Scenario-Based Analysis
This study investigates the applicability of three well-established graph-based algorithms, namely Dijkstra, Bellman-Ford, and A*, within an emergency transportation framework inspired by the urban road network of Skopje, and results indicate that all investigated algorithms successfully identify shortest feasible routes when transportation paths exist.