CAJ | 학술논문

针对当赋权连通图中存在权值相同的多条边时，传统的 Kruskal 算法不能计算出全部的最小生成树，提出了求解最小生成树的改进算法。实验结果表明，改进算法可以得到一个赋权连通图的所有最小生成树，进而为决策者提供更全面的最优决策方案。
침대당부권련통도중존재권치상동적다조변시，전통적 Kruskal 산법불능계산출전부적최소생성수，제출료구해최소생성수적개진산법。실험결과표명，개진산법가이득도일개부권련통도적소유최소생성수，진이위결책자제공경전면적최우결책방안。
For the case that the traditional Kruskal algorithm is unable to find all the minimum spanning trees(MST) when some edges have the same weights in the weighted graph ,the improved algorithm about MST was proposed .Experimental results showed that the improved algorithm can give all the minimum span‐ning trees ,which can provide a more comprehensive optimal decision‐making scheme than that of the traditional algorithm .