Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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.

share|improve this question
    
What do you mean by "anchored at each vertex"? Any spanning tree will use each vertex. –  utdiscant Feb 3 at 22:05
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.