I am taking this liberty to pose the following problem and asking for
Given a connected graph, Kirchhoff's matrix gives the total number of
spanning tree in the graph.
However enumeration can be interpreted as not only evaluating the
exact number of spanning trees but also specify the edge identifiers
for the associated branches
for such spanning tree enumeration do we have any tool ( exhaustive
and non repeating )
what is the best known algorithm in term of complexity ?
Thanks and Regards