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 
.
更多信息和选项
- TransitiveReduction functionality is now available in the built-in Wolfram Language function TransitiveReductionGraph.
- To use TransitiveReduction, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
InDegree has been superseded by VertexInDegree:
Wolfram Research (2012)，TransitiveReduction，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.
文本
Wolfram Research (2012)，TransitiveReduction，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.
CMS
Wolfram 语言. 2012. "TransitiveReduction." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html.
APA
Wolfram 语言. (2012). TransitiveReduction. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/TransitiveReduction.html 年