Shortest path algorithms play an important role in any path finding the application. These algorithms have been in existence since the mid- 1960s. This work compares two common shortest path algorithms which have played an important role in a complex map based and network-based applications (Sharma, Saini, Bhandhari). Dijkstra’s algorithm solves the problem of finding the shortest path from a point in a graph to a destination. It turns out that one can find the shortest paths from a given source to all points in a graph at the same time. This problem is sometimes called the single-source shortest paths problem (Broumi, Bakal, Talea, Smarandache, Vladareanu 2016). Shortest path algorithms have been applied to solve problems in selecting the passable route with minimum cost or time. This research applied the concept of Dijkstra’s algorithm to find the shortest path cost from point to point on a graph representing a barangay evacuation routing. Each point on the graph represents districts of the barangay and all points had values that represent the distance from each point specially, distance into the evacuation area. The researchers concluded that this algorithm is very useful in making a system that caters to the shortest path and calculates the distance and time cost into the evacuation area.