how to generate all spanning trees from one spanning tree If I have one spanning tree from a connected and undirected graph, how can I generate all other spanning trees of this graph by modifying this spanning tree one edge at a time? All intermediates must also be spanning trees of the graph.
The solution is greatly presented in Knuth's book at 7.2.1.6 (see page 23)