A Genetic Algorithm to Seek the Minimum Spanning Tree

Based on the graphic theory and genetic algorithm,an improved algorithm to encode node is introduced to search the minimum spanning tree.The algorithm is efficient and very simple and therefore easy to program.It can obtain a group of minimum or less spanning trees in order to provide more choices for decision making,while the traditional algorithms usually only get a minimum spanning tree.