In the mathematical field of graph theory, a transitive reduction of a directed graph D is another directed graph with the same vertices and as few edges as possible, such that for all pairs of vertices v, w a path from v to w in D exists if and only if such a path exists in the reduction. Wikipedia