3
$\begingroup$

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.

$\endgroup$

1 Answer 1

2
$\begingroup$

The solution is greatly presented in Knuth's book at 7.2.1.6 (see page 23)

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.