2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32054We 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 a previous one, designed to generate acyclic digraphs, non necessarily connected.6 pagesDiscrete MathematicsData Structures and AlgorithmsF.2.2;G.2.2;G.3text