提出了基于最小生成树的Steiner最小树的生成算法,分析了该算法的时间复杂性为O(nlogn)。
A Steiner Minimal Tree Algorithm which is based on Minimum Spanning Tree is presented. The overall strategy of the algorithm is as follows. Through analysis, the time complexity of the algorithm is O(nlgn).