# Transitive Reduction

Jump to navigation
Jump to search

In a directed acyclic graph, every transitive link is removed. This transformation maintains the reachability amont the nodes.

If the graph has cycles every transitive link between two different strongly connected components is removed.

See https://en.wikipedia.org/wiki/Transitive_reduction for a more detailed discussion.