Traffic congestion has become a widespread issue in many well-developed areas. This issue has mainly caused problems for ambulance services. This study was conducted to solve this issue. One of the factors of this problem is due to the increase in population. It is well known that Kuala Lumpur is a heavily populated area. Thus, this results in traffic congestion around Hospital Kuala Lumpur (HKL). The main goals of this study are to determine the shortest path between two nodes and to reduce the amount of time an ambulance needs to drive from the hospital to the accident scene. This study guarantees the Dijkstra's Algorithm method's functional efficacy within a 5-kilometer radius of HKL. As additional elements need to be taken into account, there are crucial procedures that need to be taken when using Dijkstra's Algorithm to guarantee that the time and distance computations can be approximated accurately. There are certain implicit consequences that may be detected from this project once the planning has been decided. Patients can therefore get prompt medical attention.