Combinatorica`
Combinatorica`

TransitiveReduction

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

TransitiveReduction[g]

finds a smallest graph that has the same transitive closure as g.

Details and Options

Examples

Basic Examples  (2)

InDegree has been superseded by VertexInDegree:

Wolfram Research (2012), TransitiveReduction, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.

Text

Wolfram Research (2012), TransitiveReduction, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.

CMS

Wolfram Language. 2012. "TransitiveReduction." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.

APA

Wolfram Language. (2012). TransitiveReduction. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html

BibTeX

@misc{reference.wolfram_2023_transitivereduction, author="Wolfram Research", title="{TransitiveReduction}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html}", note=[Accessed: 19-March-2024 ]}

BibLaTeX

@online{reference.wolfram_2023_transitivereduction, organization={Wolfram Research}, title={TransitiveReduction}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html}, note=[Accessed: 19-March-2024 ]}