Topological Sorting (original) (raw)

Last Updated : 04 Apr, 2025

Topological sorting for **Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u-v, vertex **u comes before **v in the ordering.

**Note: Topological Sorting for a graph is not possible if the graph is not a **DAG.

**Example:

**Input: V = 6, edges = [[2, 3], [3, 1], [4, 0], [4, 1], [5, 0], [5, 2]]

Example

**Output: 5 4 2 3 1 0
**Explanation: The first vertex in topological sorting is always a vertex with an in-degree of 0 (a vertex with no incoming edges). A topological sorting of the following graph is "5 4 2 3 1 0". There can be more than one topological sorting for a graph. Another topological sorting of the following graph is "4 5 2 3 1 0".

Table of Content

Topological Sorting vs Depth First Traversal (DFS):
Topological Sorting in Directed Acyclic Graphs (DAGs)
Algorithm for Topological Sorting using DFS:
Topological Sorting Using BFS:
Advantages of Topological Sort:
Disadvantages of Topological Sort:
Applications of Topological Sort:

**Topological Sorting vs Depth First Traversal (DFS):

In DFS, we print a vertex and then recursively call DFS for its adjacent vertices. In topological sorting, we need to print a vertex before its adjacent vertices.

**For example, In the above given graph, the vertex '5' should be printed before vertex '0', but unlike DFS, the vertex '4' should also be printed before vertex '0'. So Topological sorting is different from DFS. For example, a DFS of the shown graph is "5 2 3 1 0 4", but it is not a topological sorting.

Topological Sorting in Directed Acyclic Graphs (DAGs)

**DAGs are a special type of graphs in which each edge is directed such that no cycle exists in the graph, before understanding why Topological sort only exists for DAGs, lets first answer two questions:

**Why Topological Sort is not possible for graphs with undirected edges?

This is due to the fact that undirected edge between two vertices **u and **v means, there is an edge from **u to **v as well as from **v to **u. Because of this both the nodes **u and **v depend upon each other and none of them can appear before the other in the topological ordering without creating a contradiction.

**Why Topological Sort is not possible for graphs having cycles?

Imagine a graph with 3 vertices and edges = {1 to 2 , 2 to 3, 3 to 1} forming a cycle. Now if we try to topologically sort this graph starting from any vertex, it will always create a contradiction to our definition. All the vertices in a cycle are indirectly dependent on each other hence topological sorting fails.

Topological order may not be Unique:

**Topological sorting is a dependency problem in which completion of one task depends upon the completion of several other tasks whose order can vary. Let us understand this concept via an example:

Suppose our task is to reach our School and in order to reach there, first we need to get dressed. The dependencies to wear clothes is shown in the below dependency graph. For example you can not wear shoes before wearing socks.

From the above image you would have already realized that there exist multiple ways to get dressed, the below image shows some of those ways.

Can you list all the possible topological ordering of getting dressed for above dependency graph?

**Algorithm for Topological Sorting using DFS:

Here’s a step-by-step algorithm for topological sorting using Depth First Search (DFS):

Create a graph with n vertices and **m-directed edges.
Initialize a stack and a visited array of size **n.
For each unvisited vertex in the graph, do the following:
- Call the DFS function with the vertex as the parameter.
- In the DFS function, mark the vertex as visited and recursively call the DFS function for all unvisited neighbors of the vertex.
- Once all the neighbors have been visited, push the vertex onto the stack.
After all, vertices have been visited, pop elements from the stack and append them to the output list until the stack is empty.
The resulting list is the topologically sorted order of the graph.

Illustration Topological Sorting Algorithm:

C++ `

#include <bits/stdc++.h> using namespace std;

// Function to perform DFS and topological sorting void topologicalSortUtil(int v, vector<vector> &adj, vector &visited, stack &st) {

// Mark the current node as visited
visited[v] = true;

// Recur for all adjacent vertices
for (int i : adj[v])
{
    if (!visited[i])
        topologicalSortUtil(i, adj, visited, st);
}

// Push current vertex to stack which stores the result
st.push(v);

}

vector<vector> constructadj(int V, vector<vector> &edges) {

vector<vector<int>> adj(V);
for (auto it : edges)
{
    adj[it[0]].push_back(it[1]);
}

return adj;

}

// Function to perform Topological Sort vector topologicalSort(int V, vector<vector> &edges) {

// Stack to store the result
stack<int> st;

vector<bool> visited(V, false);
vector<vector<int>> adj = constructadj(V, edges);
// Call the recursive helper function to store
// Topological Sort starting from all vertices one by
// one
for (int i = 0; i < V; i++)
{
    if (!visited[i])
        topologicalSortUtil(i, adj, visited, st);
}

vector<int> ans;

// Append contents of stack
while (!st.empty())
{
    ans.push_back(st.top());
    st.pop();
}

return ans;

}

int main() {

// Graph represented as an adjacency list
int v = 6;
vector<vector<int>> edges = {{2, 3}, {3, 1}, {4, 0}, {4, 1}, {5, 0}, {5, 2}};

vector<int> ans = topologicalSort(v, edges);

for (auto node : ans)
{
    cout << node << " ";
}
cout << endl;

return 0;

}

Java

import java.util.*;

class GfG {

private static void
topologicalSortUtil(int v, List<Integer>[] adj,
                    boolean[] visited,
                    Stack<Integer> stack)
{
    visited[v] = true;

    for (int i : adj[v]) {
        if (!visited[i]) {
            topologicalSortUtil(i, adj, visited, stack);
        }
    }

    stack.push(v);
}
static List<Integer>[] constructadj(int V,
                                    int[][] edges)
{

    List<Integer>[] adj = new ArrayList[V];

    for (int i = 0; i < V; i++) {
        adj[i] = new ArrayList<>();
    }

    for (int[] edge : edges) {
        adj[edge[0]].add(edge[1]);
    }
    return adj;
}
static int[] topologicalSort(int V, int[][] edges)
{
    Stack<Integer> stack = new Stack<>();
    boolean[] visited = new boolean[V];

    List<Integer>[] adj = constructadj(V, edges);
    for (int i = 0; i < V; i++) {
        if (!visited[i]) {
            topologicalSortUtil(i, adj, visited, stack);
        }
    }

    int[] result = new int[V];
    int index = 0;
    while (!stack.isEmpty()) {
        result[index++] = stack.pop();
    }

    return result;
}

public static void main(String[] args)
{
    int v = 6;
    int[][] edges = {{2, 3}, {3, 1}, {4, 0},
                      {4, 1}, {5, 0}, {5, 2}};

    int[] ans = topologicalSort(v, edges);

    for (int node : ans) {
        System.out.print(node + " ");
    }
    System.out.println();
}

}

Python

Function to perform DFS and topological sorting

def topologicalSortUtil(v, adj, visited, stack): # Mark the current node as visited visited[v] = True

# Recur for all adjacent vertices
for i in adj[v]:
    if not visited[i]:
        topologicalSortUtil(i, adj, visited, stack)

# Push current vertex to stack which stores the result
stack.append(v)

def constructadj(V, edges): adj = [[] for _ in range(V)]

for it in edges:
    adj[it[0]].append(it[1])

return adj

Function to perform Topological Sort

def topologicalSort(V, edges): # Stack to store the result stack = [] visited = [False] * V

adj = constructadj(V, edges)
# Call the recursive helper function to store
# Topological Sort starting from all vertices one by one
for i in range(V):
    if not visited[i]:
        topologicalSortUtil(i, adj, visited, stack)

# Reverse stack to get the correct topological order
return stack[::-1]

if name == 'main': # Graph represented as an adjacency list v = 6 edges = [[2, 3], [3, 1], [4, 0], [4, 1], [5, 0], [5, 2]]

ans = topologicalSort(v, edges)

print(" ".join(map(str, ans)))

C#

using System; using System.Collections.Generic;

class GfG { static void TopologicalSortUtil(int v, List[] adj, bool[] visited, Stack stack) { visited[v] = true;

    foreach(int i in adj[v])
    {
        if (!visited[i]) {
            TopologicalSortUtil(i, adj, visited, stack);
        }
    }

    stack.Push(v);
}

static List<int>[] constructadj(int V, int[][] edges)
{
    List<int>[] adj = new List<int>[ V ];

    for (int i = 0; i < V; i++) {
        adj[i] = new List<int>();
    }

    foreach(int[] edge in edges)
    {
        adj[edge[0]].Add(edge[1]);
    }

    return adj;
}

static int[] TopologicalSort(int V, int[][] edges)
{
    Stack<int> stack = new Stack<int>();
    bool[] visited = new bool[V];

    List<int>[] adj = constructadj(V, edges);

    for (int i = 0; i < V; i++) {
        if (!visited[i]) {
            TopologicalSortUtil(i, adj, visited, stack);
        }
    }

    int[] result = new int[V];
    int index = 0;
    while (stack.Count > 0) {
        result[index++] = stack.Pop();
    }

    return result;
}

public static void Main()
{
    int v = 6;
    int[][] edges
        = { new int[] {2, 3}, new int[] {3, 1},
            new int[] {4, 0}, new int[] {4, 1},
            new int[] {5, 0}, new int[] {5, 2} };

    int[] ans = TopologicalSort(v, edges);

    Console.WriteLine(string.Join(" ", ans));
}

}

JavaScript

// Function to perform DFS and topological sorting function topologicalSortUtil(v, adj, visited, st) { // Mark the current node as visited visited[v] = true;

// Recur for all adjacent vertices
for (let i of adj[v]) {
    if (!visited[i])
        topologicalSortUtil(i, adj, visited, st);
}

// Push current vertex to stack which stores the result
st.push(v);

}

function constructadj(V, edges) { let adj = Array.from( {length : V}, () => []); // Fixed the adjacency list declaration

for (let it of edges) {
    adj[it[0]].push(
        it[1]); // Fixed adjacency list access
}
return adj;

}

// Function to perform Topological Sort function topologicalSort(V, edges) { // Stack to store the result let st = []; let visited = new Array(V).fill(false);

let adj = constructadj(V, edges);

// Call the recursive helper function to store
// Topological Sort starting from all vertices one by
// one
for (let i = 0; i < V; i++) {
    if (!visited[i])
        topologicalSortUtil(i, adj, visited, st);
}

let ans = [];

// Append contents of stack
while (st.length > 0) {
    ans.push(st.pop());
}

return ans;

}

// Main function let v = 6; let edges = [ [2, 3], [3, 1], [4, 0], [4, 1], [5, 0], [5, 2] ];

let ans = topologicalSort(v, edges);

console.log(ans.join(" ") + " ");

**Time Complexity: O(V+E). The above algorithm is simply DFS with an extra stack. So time complexity is the same as DFS.
**Auxiliary space: O(V). due to creation of the stack.

We do not count the adjacency list in auxiliary space as it is necessary for representing the input graph.

**Topological Sorting Using BFS:

The BFS based algorithm for Topological Sort is called Kahn's Algorithm. The Kahn's algorithm has same time complexity as the DFS based algorithm discussed above.

**Advantages of Topological Sort:

Helps in scheduling tasks or events based on dependencies.
Detects cycles in a directed graph.
Efficient for solving problems with precedence constraints.

Disadvantages of Topological Sort:

Only applicable to directed acyclic graphs (DAGs), not suitable for cyclic graphs.
May not be unique, multiple valid topological orderings can exist.

Applications of Topological Sort:

Task scheduling and project management.
In software deployment tools like Makefile.
Dependency resolution in package management systems.
Determining the order of compilation in software build systems.
Deadlock detection in operating systems.
Course scheduling in universities.
It is used to find shortest paths in weighted directed acyclic graphs

**Related Articles: