根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
主要研究两类约束最小支撑树问题，即点约束和边约束最小支撑树问题。
In this paper, two types of the minimum weight spanning tree with constraints are investigated.
主要研究两类约束最小支撑树问题，即点约束和边约束最小支撑树问题。
In this paper, two types of the minimum weight spanning tree with constraints are investigated.
应用推荐