We apply the concept of self-stabilizing to solve the shortest detour problem in biconnected graph and assume the presence of distributed demon in system.