A transitive closure graph is a representation of a [[graph]] that includes an edge between any two nodes $i$ and $j$ if there is a path from $i$ to $j$ in the original graph. Simply calculate the all pairs shortest path for the graph; if there is a shortest path (i.e., path costs lt; \infty$) then there is an edge in the transitive closure graph.