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 g such that an edge implies that vertex appears before vertex .

Details

Examples

Basic Examples  (2)

This function has been superseded by TopologicalSort in the Mathematica kernel:

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.

BibTeX

@misc{reference.wolfram_2021_topologicalsort, author="Wolfram Research", title="{TopologicalSort}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html}", note=[Accessed: 05-December-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_topologicalsort, organization={Wolfram Research}, title={TopologicalSort}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TopologicalSort.html}, note=[Accessed: 05-December-2021 ]}

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