Implementation of Finding Shortest Path for Fire Incidence Using Dijkstra’s Algorithm

Abstract

The fire service mission is to assist the public in the protection of life and properties by minimizing the impact of fire, medical emergencies, and potential disasters or events that affect communities and the enviromnment.Implementation of the system is bases on the Dijkstra’s algorithm which efficiently finds the shortest path from the fire station to the fire incidence. When a fire occurs, any delay of responding fire stations can make the difference between the rescue of occupants versus serious injury or death. Dijkstra’s algorithm is one of the most effective algorithms to find the shortest path between two points, fire station and the place of fire accidence. It is simple, easy to understand and implement, yet impressively efficient. This system is also implemented by using the theory based on Dijkstra’s Algorithm.