GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/TransitiveReduction

GraphTheory

  

TransitiveReduction

  

construct transitive reduction

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

TransitiveReduction( G )

Parameters

G

-

a graph

Description

• 

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.

Examples

Construct the transitive reduction graph of a simple directed graph and visualize the two graphs.

withGraphTheory:

GGraph4,1,2,2,3,3,4,1,4

GGraph 1: a directed unweighted graph with 4 vertices and 4 arc(s)

(1)

HTransitiveReductionG

HGraph 2: a directed unweighted graph with 4 vertices and 3 arc(s)

(2)

DrawGraphG,H,style=circle

Compatibility

• 

The GraphTheory[TransitiveReduction] command was introduced in Maple 2019.

• 

For more information on Maple 2019 changes, see Updates in Maple 2019.

See Also

GraphTheory

GraphTheory[AllPairsDistance]

GraphTheory[ReverseGraph]

GraphTheory[TransitiveClosure]