TopologicalSort

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

TopologicalSort[{vw,}]
uses rules vw to specify the graph g.

DetailsDetails

  • A list of vertices is topologically sorted if u precedes v for each edge uv.
Introduced in 2010
(8.0)
| Updated in 2015
(10.3)