Transitive Reduction

From visone manual
Revision as of 13:32, 29 July 2015 by Nocaj (talk | contribs) (Created page with "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 betw...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.