Selection of Rescuing Plan for Natural Disaster Zone

Dijkstra’s Algorithm solves the problem offinding the shortest path from a point (the source) to adestination. This problem is sometimes called the single-sourceshortest path problem. In these days, the world become warmerday after day and the effect of that Global Warming problem,weather and natural change unpredictably. Because of theweather changes, unexpected disasters can happen. Thosenatural disasters may destroy all the living things, buildings andwealth. Therefore, disastrous recovery plans should have beenplanned. There are many requirements for the disastrousrecovery such as time, manpower, money, transport, decisionmaking quality and so on. In this paper, transport area ofdisastrous recovery will be specialized. In transport area,finding the shortest path to the destination is important as wellas calculating the minimum cost, time and distance to arrive tothe destination and performing the recovery plan