摘要
I. INTRODUCTION The famous 'greedy' algorithm is very useful for finding the minimum spanning tree of a connected graph. For a special vertex of a connected graph, Glover and Klingman gave a good algorithm for finding the minimum spanning tree in which this vertex is required to have a fixed number of incident edges. Burns and Haff got an algorithm for generating all the spanning trees in order of weight, which
