THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

DOCUMENTATION CENTER SEARCH

Mathematica > Mathematics and Algorithms > Graphs & Networks > Paths and Cycles > TopologicalSort >

Mathematica > Visualization and Graphics > Graphs & Networks > Paths and Cycles > TopologicalSort >

BUILT-IN MATHEMATICA SYMBOL

TopologicalSort

TopologicalSort[g]
gives a list of vertices of g in topologically sorted order for a directed acyclic graph g.

Find the topological order of vertices:

Out[1]=

TopologicalSort works with directed graphs:

Weighted graphs:

TopologicalSort only works with acyclic graphs:

Works with large graphs:

Sort strongly connected components instead of vertices when there are cycles:

Construct the condensation of g by finding the edges between the components:

Use the topological ordering of the strongly connected components to order the vertices of g:

The new adjacency matrix is block upper triangular: