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.
英
美
- 我们应用自我稳定的概念来求解双连通图的最短绕路问题,并且假设系统内存在一分散式控制系统。