The transitive reduction of a finite directed graph G is a graph with the fewest possible edges that has the same reachability relation as the original graph.
The transitive reduction of a finite directed acyclic graph G is unique, and consists of the edges of G that form the only path between their endpoints.