本文通过对Goldstein枝切算法的研究和分析,针对它的枝切线连接策略中存在的缺陷,采用基于度的最短路径算法改进了枝切线的连接策略,消除了Goldstein枝切线中的圈和贯通枝切线,减少了孤立区域;与Prim算法相比,在兼顾运算效率的条件下有效地改善了解缠结果。 In this paper, by researching and analyzing Goldstein’s algorithm, aiming at its defects in the strategy of connecting the tangents to the branches, the degree-based shortest path algorithm is used to improve the connection strategy of the tangents, and the elimination of the circles and through branches in the Goldstein’s tangents Compared with the Prim algorithm, it improves the unwrapping results effectively with the consideration of computational efficiency.