Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm looking for a way to generate random connected directed acyclic graphs, where I can specify the number of vertices that have no outgoing edges (leaf vertices).

Anyone ever seen such a thing, or know how to generate such graphs?

Thanks.

share|cite|improve this question
    
What do you mean by random in this context? – copper.hat May 7 '12 at 4:10
    
Basically, I provide the number of vertices, number of edges, and number of leaf vertices, and edges will be assigned randomly among the vertices. – Erich Peterson May 7 '12 at 4:20

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.