Stony Brook Algorithm Repository

Topological Sorting


Input Description: A directed, acyclic graph \(G=(V,E)\) (also known as a partial order or poset).
Problem: Find a linear ordering of the vertices of \(V\) such that for each edge \((i,j) \in E\), vertex \(i\) is to the left of vertex \(j\).

Excerpt from The Algorithm Design Manual: Topological sorting arises as a natural subproblem in most algorithms on directed acyclic graphs. Topological sorting orders the vertices and edges of a DAG in a simple and consistent way and hence plays the same role for DAGs that depth-first search does for general graphs.

Topological sorting can be used to schedule tasks under precedence constraints. Suppose we have a set of tasks to do, but certain tasks have to be performed before other tasks. These precedence constraints form a directed acyclic graph, and any topological sort (also known as a linear extension) defines an order to do these tasks such that each is performed only after all of its constraints are satisfied.


Boost Graph Library (rating 10)
C++ Boost Library (rating 10)
C-Sharp-Algorithms (rating 9)
java-algorithms-implementation (rating 9)
LEDA (rating 9)
goraph (rating 8)
JGraphT (rating 8)
JDSL (rating 8)
Algorithms in C++ (rating 3)
Moret and Shapiro's Algorithms P to NP (rating 3)

Recommended Books

Algorithms in Java, Third Edition (Parts 1-4) by Robert Sedgewick and Michael Schidlowsky Introduction to Algorithms by T. Cormen and C. Leiserson and R. Rivest and C. Stein Introduction to Algorithms by U. Manber

Related Problems

Bandwidth Reduction

Feedback Edge/Vertex Set

Job Scheduling


As an Amazon affiliate, I earn from qualifying purchases if you buy from links on this website.

Go To Main Page