中文摘要：

基于最小生成树思想，并考虑多个连通图的情况，改进了现有的闭合环搜索算法。依据边的端点和长度信息建立树与余枝，从余枝中依次寻找能生成最小环的一条优先构成闭合环，以满足最短路径条件；通过设置余枝与闭合环的一一对应关系以满足独立条件。最后，将该算法用于InSAR相位解缠误差的探测，明显提高了InSAR数据处理的效率。

英文摘要：

Based on the Minimum Spanning Tree （MST） method, we improved the searching algorithm for minimum closed loops in consideration of multiple connected graphs. A tree and some redundant branches are built up according to the nodes and the length of edges. The minimum spanning condition was satisfied by sequentially selecting the redundant branch which can construct the minimum loop. The independent condition was satisfied by keeping one-to-one correspondence between the redundant branch and minimum loop. Finally, we applied the algo- rithm to detect InSAR phase unwrapping errors which greatly improved the efficiency of InSAR data processing.