# Question:Is there any bugs in GraphTheory['TransitiveReduction']?

## Question:Is there any bugs in GraphTheory['TransitiveReduction']?

Maple 2023

According to this help page

the transitive reduction of graph `G`, is the graph with the fewest edges that still shares the same reachability as `G` (but might contain new edges not present in `G`).

However, in Maple 2023, things become strange; different branches return distinct numbers of edges:
(33 arcs or 40 arcs?)

 > restart;
 > with(GraphTheory):
 >
 GraphTheory:-TransitiveReduction := proc(G::GRAPHLN, \$) local D, V, T, i, j, k, A, M, n, flags, B;        ...    4   if _EnvDisableExt <> true then            ...        elif D <> (':-directed') then            ...        else            ...        end if;        ... end proc
 >
 (1)
 >
 (2)
 >
 (3)
 >
 (4)
 >

```G__0 := GraphTheory:-Digraph({[3, 1], [9, 3], [4, 9], [14, 9], [10, 4], [5, 10], [15, 10], [11, 5], [19, 11], [12, 6], [7, 12], [17, 12], [13, 7], [8, 13], [2, 8], [10, 14], [18, 14], [11, 15], [6, 19], [16, 19], [23, 19], [13, 17], [15, 18], [21, 18], [12, 16], [22, 16], [22, 23], [20, 22], [19, 21], [17, 20]}):