Based on MCC,we construct an overlapping graph and give a set of algorithm according to the graph to work out the route as short as possible to avoid the appearance of fault block when Manhattan route does not exist.

• 本文在mcc基础上 ；建立mcc重叠图 ；当发现不存在曼哈顿路径的时候 ；给出一套算法 ；来计算出一条避免无效块的尽可能短的路径 .