Generating connected acyclic digraphs uniformly at random

Guy Melancon, Fabrice Philippe

We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of…