Smith, Malcolm James2024-08-152024-08-1519971997https://hdl.handle.net/1828/19740Algorithms 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.88 pagesAvailable to the World Wide WebThesis