TopologicalSort[g]
gives a permutation of the vertices of the directed acyclic graph 
such that an edge 
implies that vertex 
appears before vertex 
.
TopologicalSort
TopologicalSort[g]
gives a permutation of the vertices of the directed acyclic graph 
such that an edge 
implies that vertex 
appears before vertex 
.
更多信息和选项
- TopologicalSort functionality is now available in the built-in Wolfram Language function TopologicalSort.
- To use TopologicalSort, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
相关链接
- XXXX
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System.
▪
>>
文本
Wolfram Research (2012)，TopologicalSort，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html.
CMS
Wolfram 语言. 2012. "TopologicalSort." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html.
APA
Wolfram 语言. (2012). TopologicalSort. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html 年