A new algorithm for a construction of the transitive closure of directed acyclic graphs is suggested. An analysis of computation of the transitive closure of directed graphs is presented
