gives a transitive reduction of the graph g.
uses rules vw to specify the graph g.
Details and Options
- TransitiveReductionGraph is also known as minimum equivalent graph.
- The transitive reduction h of a graph g is a graph that has the same transitive closure as g, with a minimal number of edges.
- TransitiveReductionGraph takes the same options as Graph.
- TransitiveReductionGraph works with undirected graphs, directed graphs, and multigraphs.
Examplesopen allclose all
Properties & Relations (3)
TransitiveReductionGraph[g] has the same vertices as g: