用遗传算法求最小生成树

he minimum spanning tree of different representatives of different scenarios, it is best able to identify a small number of the minimum or sub-spanning tree in order to choose from, so that decision-making more scientific. To seek the minimum spanning tree,this paper presents a genetic algorithm wih the abolition of cross-operator, the modification of mutation operator and selection operator. Use of the algorithm, you can in a shorter time and with a higher probability to obtain a small number of the minimum or sub-spanning tree, while the traditional algorithms usually only get a minimum spanning tree.