Note: This page has been translated by MathWorks. Please click here

To view all translated materials including this page, select Japan from the country navigator on the bottom of this page.

To view all translated materials including this page, select Japan from the country navigator on the bottom of this page.

Transitive reduction

`H = transreduction(G)`

returns the transitive reduction of
graph `H`

= transreduction(`G`

)`G`

as a new graph, `H`

. The nodes in
`H`

are the same as those in `G`

, but
`H`

has different edges. `H`

contains the
fewest number of edges such that if there is a path from node `i`

to node `j`

in `G`

, then there is also a path from
node `i`

to node `j`

in
`H`

.

Was this topic helpful?