Transitive Closure

Graph constructed from an initial graph, which includes new arcs(edges) representing all the indirect paths that exists in the initial graph

• Complexity => Θ(n4)