construct transitive reduction
TransitiveReduction( G )
The TransitiveReduction( G ) command constructs the graph which is the transitive reduction of the graph G with respect to the edge relation.
The transitive reduction of an graph G is a undirected graph which has the same vertex set and transitive closure as G, but with a minimal number of edges.
Construct the transitive reduction graph of a simple directed graph and visualize the two graphs.
G ≔ Graph⁡4,1,2,2,3,3,4,1,4
G≔Graph 1: a directed graph with 4 vertices and 4 arc(s)
H ≔ TransitiveReduction⁡G
H≔Graph 2: a directed graph with 4 vertices and 3 arc(s)
The GraphTheory[TransitiveReduction] command was introduced in Maple 2019.
For more information on Maple 2019 changes, see Updates in Maple 2019.
Download Help Document