I have a strongly connected directed graph with about 10 vertices and 20 edges, and would like to find all spanning trees anchored at each vertex. Is there a systematic way, or a tested program/algorithm that would help me find all these spanning trees?
When I was looking at graphs with a smaller number of vertices and edges, I could simply write the spanning trees at each vertex out, but this gets more cumbersome when the graph gets bigger. Thanks in advance for your suggestions.