摘要：In many applications like robot navigation, games, transportation and communication routing, shortest path plays an important role. In such applications vigorous and proficient recovery is vital. Planning for the recovery from failure with minimum additional healing cost, as well as no or least delay is desired. This study presents an algorithm to construct a tree that has all possible recovery plans embedded in it.
