Combinatorica`
Combinatorica`
TopologicalSort
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
TopologicalSort[g]
gives a permutation of the vertices of the directed acyclic graph 
such that an edge 
implies that vertex 
appears before vertex 
.
Details and Options
- 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`"].
Examples
Wolfram Research (2012), TopologicalSort, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html.
Text
Wolfram Research (2012), TopologicalSort, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html.
CMS
Wolfram Language. 2012. "TopologicalSort." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html.
APA
Wolfram Language. (2012). TopologicalSort. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html