Topological Sort of a Directed Acyclic Graph

External

• https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/yeKm7/topological-sort

Internal

• Directed Acyclic Graphs
• Topological Order of a Directed Graph
• Searching Graphs

Overview

This is a very useful algorithm when a set of tasks that have precedence constraints between them need to be sequenced - executed in order. The topological sort can be done in a straightforward recursive way or using Depth-First Search (DFS).

Straightforward Algorithm

We use the observation that a DAG must have one or more sink vertices. The algorithm starts with a sink vertex, assigns to it the largest possible label, deletes the respective sink vertex from the graph, and repeats until there are no more vertices.

Straightforward_Topological_Sort(Graph G)
  let v be a sink vertex of G
  set f(v) = n
  Straightforward_Topological_Sort(G - {v})