针对传统的匈牙利算法在求解旅行商问题（travelling salesman problem, TSP）时会导致多回路闭合的问题，提出了破环机制，设计了破环匈牙利算法。通过采用分配问题的描述方法对旅行商问题进行建模，并建立二者之间的转换关系，论证了TSP可行解的充分必要条件是对应分配问题的可行解与辅助边结合后仅包含一个环路，对6个标准旅行商进行测试和对比分析，验证算法的有效性。实验结果表明：在不同的数据集中，改进匈牙利算法能有效求出TSP问题的解。

To address the issue of multiple closed circuits arising from applying the traditional Hungarian algorithm to the travelling salesman problem (TSP), a breaking mechanism was proposed, leading to the development of the Break-Cycle Hungarian Algorithm. By adopting the description method of the assignment problem for modeling the TSP and establishing the conversion relationship between them, it is demonstrated that a sufficient and necessary condition for a feasible solution to the TSP is that the feasible solution of the corresponding assignment problem, combined with auxiliary edges, contains only one cycle. The effectiveness of the algorithm was verified through testing and comparative analysis on six standard travelling salesmen, showing that the improved Hungarian algorithm can effectively solve the TSP across various datasets.