Transitive Reduction

From visone manual
Revision as of 05:39, 30 July 2015 by Nocaj (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

In a directed acyclic graph, every transitive link is removed. This transformation maintains the reachability among 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.