We show two approaches and two BSP/CGM algorithms to compute a transitive closure of digraphs. Our ideas are based in a detailed observation of BSP/CGM algorithmspresented by Alves et al. and Castro Jr.. We improved the algorithms performance by decreasing the message length changed between processors, the local computation andthe number of communication rounds. The results obtained by implementations of our approaches and algorithms are better than the results obtained by other authors.