Generating spanning trees
Date
1997
Authors
Smith, Malcolm James
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Algorithms for generating all spanning trees of a graph are presented. A series of improvements to the basic contraction-deletion algorithm results in the development of an algorithm which generates spanning trees in a Gray code order in constant amortized time. The improvements consist of removing loop edges in the graph, replacing sets of parallel edges with a single parallel edge record, and removing degree two vertices and replacing each pair of incident edges with a series edge record.