Topological Sort in Graph

Welcome to our beginner's guide to Topological Sort in Graph Theory! Topological Sort is an essential algorithm used to order the vertices of a directed graph such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. Let's explore this important concept together!

Understanding the Problem Statement

Before delving into Topological Sort, let's understand the problem it addresses. Consider a scenario where tasks depend on one another; for example, in a project where certain tasks must be completed before others can begin. Such dependencies can be modeled using directed graphs, where nodes represent tasks and directed edges represent dependencies between tasks.

The goal of Topological Sort is to find a linear ordering of the vertices of the graph such that for every directed edge uv, the vertex u comes before the vertex v in the ordering. This ordering provides a sequence in which the tasks can be performed without violating any dependencies.

What is Topological Sort?

Topological Sort is an algorithm used to order the vertices of a directed graph in a linear sequence based on their dependencies. It helps in determining a valid sequence of tasks or events that respects all dependencies.

Topological Sort is primarily used in scenarios where there is a partial ordering among elements, such as scheduling tasks, resolving dependencies in software builds, and analyzing precedence constraints in job scheduling.

How does Topological Sort Work?

Topological Sort can be achieved using Depth-First Search (DFS) or Breadth-First Search (BFS) algorithms. The key idea is to visit the vertices of the graph in a particular order that respects the directed edges.

The algorithm follows these steps:

  1. Start with an empty result list to store the topological ordering.
  2. Perform a depth-first search (DFS) or breadth-first search (BFS) on the graph.
  3. During the traversal, visit each vertex and explore its neighbors.
  4. After visiting all neighbors of a vertex, add the vertex to the beginning of the result list.
  5. The final result list represents the topological ordering of the graph.

Topological Sort Example using BFS (Kahn's Algorithm)

Using Kahn's Algorithm for topological sorting on the following directed acyclic graph (DAG): 


    5 → 0
    ↓   ↑
    2 → 3
    ↓
    4

Topological Sorting Steps:

  1. Identify vertices with no incoming edges. Initially, vertices 5 and 3.
  2. Enqueue 5 and 3 into the queue.
  3. Dequeue 5, add it to the topological order, and remove all outgoing edges.
    4. Topological Order: [5]
  4. Dequeue 3, add it to the topological order, and remove all outgoing edges.
    5. Topological Order: [5, 3]
  5. Now, vertex 2 has no incoming edges. Enqueue and dequeue 2, add to topological order.
    6. Topological Order: [5, 3, 2]
  6. Finally, vertex 0 and 4 have no incoming edges. Add them to the topological order.
    7. Topological Order: [5, 3, 2, 0, 4]
  7. The final topological order is [5, 3, 2, 0, 4].

Topological Sort Example using DFS

Demonstrating topological sorting using DFS on the same directed acyclic graph (DAG). 


    5 → 0
    ↓   ↑
    2 → 3
    ↓
    4

Topological Sorting Steps:

  1. Perform DFS starting from each unvisited vertex. Begin with vertex 5.
  2. Visit vertex 5, then move to its unvisited neighbor 2.
  3. Visit vertex 2, then move to its unvisited neighbor 4.
  4. Vertex 4 has no unvisited neighbors. Add 4 to the result list.
    5. Topological Order: [4]
  5. Backtrack to vertex 2. Add 2 to the result list.
    6. Topological Order: [4, 2]
  6. Backtrack to vertex 5. Visit vertex 0.
  7. Vertex 0 leads to 3, which has no unvisited neighbors. Add 3 and then 0 to the result list.
    8. Topological Order: [4, 2, 3, 0]
  8. Finally, add 5 to the result list.
    9. Topological Order: [4, 2, 3, 0, 5]
  9. The final topological order is [4, 2, 3, 0, 5].
Example Application of Topological Sort

Let's consider a project management scenario where tasks are represented as vertices in a directed graph, and dependencies between tasks are represented as directed edges. By performing a Topological Sort on the graph, we can determine a valid sequence of tasks that respects all dependencies, ensuring that dependent tasks are completed before the tasks that depend on them.

Implementing Topological Sort in Code

Now, let's take a look at how we can implement Topological Sort in code. We'll provide examples in several programming languages to help you get started: 


package codeKatha;

import java.util.*;

public class TopologicalSort {

    public List<Integer> topologicalSortDFS(Graph graph) {
    
        Stack<Integer> stack = new Stack<>();
        Set<Integer> visited = new HashSet<>();

        for (int vertex : graph.getVertices()) {
            if (!visited.contains(vertex)) {
                dfs(vertex, graph, stack, visited);
            }
        }

        List<Integer> result = new ArrayList<>();
        
        while (!stack.isEmpty()) {
            result.add(stack.pop());
        }
        return result;
    }

    private void dfs(int vertex, Graph graph, Stack<Integer> stack, Set<Integer> visited) {
    
        visited.add(vertex);
        
        for (int neighbor : graph.getNeighbors(vertex)) {
        
            if (!visited.contains(neighbor)) {
                dfs(neighbor, graph, stack, visited);
            }
        }
        
        stack.push(vertex);
    }

    public List<Integer> topologicalSortBFS(Graph graph) {
    
        Queue<Integer> queue = new LinkedList<>();
        Map<Integer, Integer> inDegree = new HashMap<>();

        // Calculate in-degrees of all vertices
        for (int vertex : graph.getVertices()) {
            inDegree.put(vertex, 0);
        }
        for (int vertex : graph.getVertices()) {
            for (int neighbor : graph.getNeighbors(vertex)) {
                inDegree.put(neighbor, inDegree.get(neighbor) + 1);
            }
        }

        // Enqueue vertices with in-degree 0
        for (int vertex : inDegree.keySet()) {
            if (inDegree.get(vertex) == 0) {
                queue.add(vertex);
            }
        }

        List<Integer> result = new ArrayList<>();
        
        // Perform BFS
        while (!queue.isEmpty()) {
        
            int vertex = queue.poll();
            result.add(vertex);
            
            for (int neighbor : graph.getNeighbors(vertex)) {
            
                inDegree.put(neighbor, inDegree.get(neighbor) - 1);
                
                if (inDegree.get(neighbor) == 0) {
                    queue.add(neighbor);
                }
            }
        }

        return result.size() == graph.getVertices().size() ? result : new ArrayList<>(); // Graph contains a cycle
    }
}


#include <iostream>
#include <stack>
#include <vector>
#include <unordered_set>
#include "Graph.h"

class TopologicalSort {
public:
    std::vector<int> topologicalSortDFS(Graph& graph) {
    
        std::stack<int> stack;
        std::unordered_set<int> visited;

        for (int vertex : graph.getVertices()) {
        
            if (visited.find(vertex) == visited.end()) {
                dfs(vertex, graph, stack, visited);
            }
        }

        std::vector<int> result;
        
        while (!stack.empty()) {
        
            result.push_back(stack.top());
            stack.pop();
        }
        return result;
    }

private:
    void dfs(int vertex, Graph& graph, std::stack<int>& stack, std::unordered_set<int>& visited) {
    
        visited.insert(vertex);
        
        for (int neighbor : graph.getNeighbors(vertex)) {
        
            if (visited.find(neighbor) == visited.end()) {
                dfs(neighbor, graph, stack, visited);
            }
        }
        stack.push(vertex);
    }

    std::vector<int> topologicalSortBFS(Graph& graph) {
        std::queue<int> queue;
        std::unordered_map<int, int> inDegree;

        // Calculate in-degrees of all vertices
        for (int vertex : graph.getVertices()) {
            inDegree[vertex] = 0;
        }
        for (int vertex : graph.getVertices()) {
            for (int neighbor : graph.getNeighbors(vertex)) {
                inDegree[neighbor]++;
            }
        }

        // Enqueue vertices with in-degree 0
        for (auto& pair : inDegree) {
            if (pair.second == 0) {
                queue.push(pair.first);
            }
        }

        std::vector<int> result;
        // Perform BFS
        while (!queue.empty()) {
        
            int vertex = queue.front();
            queue.pop();
            result.push_back(vertex);
            
            for (int neighbor : graph.getNeighbors(vertex)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.push(neighbor);
                }
            }
        }

        return result.size() == graph.getVertices().size() ? result : std::vector<int>{}; // Graph contains a cycle
    }
};


class TopologicalSort:
    def topological_sort_dfs(self, graph):
        stack = []
        visited = set()

        def dfs(vertex):
        
            visited.add(vertex)
            for neighbor in graph.get_neighbors(vertex):
                if neighbor not in visited:
                    dfs(neighbor)
            stack.append(vertex)

        for vertex in graph.get_vertices():
            if vertex not in visited:
                dfs(vertex)

        return stack[::-1]

    def topological_sort_bfs(self, graph):
    
        in_degree = {vertex: 0 for vertex in graph.get_vertices()}
        queue = collections.deque()

        for vertex in graph.get_vertices():
            for neighbor in graph.get_neighbors(vertex):
                in_degree[neighbor] += 1

        for vertex, degree in in_degree.items():
            if degree == 0:
                queue.append(vertex)

        result = []
        while queue:
            current_vertex = queue.popleft()
            result.append(current_vertex)
            for neighbor in graph.get_neighbors(current_vertex):
                in_degree[neighbor] -= 1
                if in_degree[neighbor] == 0:
                    queue.append(neighbor)

        if len(result) != len(graph.get_vertices()):
            return []

        return result




class TopologicalSort {
    topologicalSortDFS(graph

) {
        const stack = [];
        const visited = new Set();

        const dfs = (vertex) => {
            visited.add(vertex);
            for (let neighbor of graph.getNeighbors(vertex)) {
                if (!visited.has(neighbor)) {
                    dfs(neighbor);
                }
            }
            stack.push(vertex);
        };

        for (let vertex of graph.getVertices()) {
            if (!visited.has(vertex)) {
                dfs(vertex);
            }
        }

        return stack.reverse();
    }

    topologicalSortBFS(graph) {
    
        const inDegree = new Map();
        const queue = [];

        // Calculate in-degrees of all vertices
        for (let vertex of graph.getVertices()) {
            inDegree.set(vertex, 0);
        }
        for (let vertex of graph.getVertices()) {
            for (let neighbor of graph.getNeighbors(vertex)) {
                inDegree.set(neighbor, inDegree.get(neighbor) + 1);
            }
        }

        // Enqueue vertices with in-degree 0
        for (let [vertex, degree] of inDegree) {
            if (degree === 0) {
                queue.push(vertex);
            }
        }

        const result = [];
        // Perform BFS
        while (queue.length > 0) {
        
            const currentVertex = queue.shift();
            result.push(currentVertex);
            
            for (let neighbor of graph.getNeighbors(currentVertex)) {
            
                inDegree.set(neighbor, inDegree.get(neighbor) - 1);
                if (inDegree.get(neighbor) === 0) {
                    queue.push(neighbor);
                }
            }
        }

        return result.length === graph.getVertices().size ? result : []; // Graph contains a cycle
    }
}

Graph: Concept and Important Algorithms

1. Basics of Graph Data Structure
2. Breadth-First Search (BFS) in Graph
3. Depth-First Search (DFS) in Graph 
4. Topological Sort in Graph
5. Union-Find Algorithm in Graph
6. Prim's Algorithm in Graph 
7. Dijkstra's Algorithm in Graph
8. Kruskal's Algorithm in Graph

Congratulations! You've now learned the basics of Topological Sort in graph theory. Feel free to experiment with the provided code examples and explore further applications of Topological Sort in your projects.

Related categories:

Comments

Post a Comment

Popular Posts on Code Katha

Java Interview Questions for 10 Years Experience

Image
Welcome to the comprehensive guide on "Java Interview Questions for 10 Years Experience." Java has been one of the most popular programming languages for decades, and its widespread adoption means that the demand for skilled Java developers has never been higher. If you are someone who has been working with Java for the last decade, you have accumulated a wealth of experience and knowledge that you can showcase during interviews. Recommended  to read and brush up for your interview: Must know interview questions and concept for any Java Interview Spring boot interview Questions for 10 years experiance This blog post will provide you with a list of commonly asked interview questions for 10 years experienced Java developers. It will also include detailed answers to each question, with explanations and examples to help you understand the concepts and their practical implementations better. Whether you are preparing for a job interview or just want to brush up your knowl
Read more

Sql Interview Questions for 10 Years Experience

Image
As an experienced SQL professional, you might encounter challenging questions during a job interview. In this blog post, we will explore 10 common SQL interview questions and provide in-depth explanations along with relevant examples. Let's dive in! Contents [ hide ] What is SQL Injection, and how can you prevent it? SQL Injection is a malicious attack where an attacker manipulates input data to execute unintended SQL statements. It can lead to unauthorized access, data breaches, and data manipulation. To prevent SQL Injection, follow these best practices: 1.1. Use Prepared Statements: Prepared statements or parameterized queries separate SQL code from data input, preventing attackers from injecting malicious SQL code. Here's an example in PHP: $stmt = $pdo->prepare('SELECT * FROM users WHERE username = :username'); $stmt->bindParam(':username', $username); $stmt->execute(); 1.2. Sanitize User Input: Validate and sanitize user input
Read more

Spring Boot Interview Questions for 10 Years Experience

Image
Welcome to the comprehensive guide on "Spring Boot Interview Questions for 10 Years Experience". Spring Boot has become one of the most popular frameworks for developing enterprise-grade applications, and its widespread adoption means that the demand for skilled Spring Boot developers has never been higher. If you are someone who has been working with Spring Boot for the last decade, you have accumulated a wealth of experience and knowledge that you can showcase during interviews. Recommended  to read and brush up for your interview: Must know interview questions and concept for any Java Interview Java Interview Questions for 10 Years Experience This blog post will provide you with a list of commonly asked interview questions for 10 years experienced Spring Boot developers. It will also include detailed answers to each question, with explanations and examples to help you understand the concepts and th
Read more

Visual Studio Code setup for Java and Spring with GitHub Copilot

Image
Introduction- In this tutorial blog, we will explore the process of setting up and utilising Visual Studio Code for Java programming, as well as incorporating GitHub Copilot as a valuable coding tool. Visual Studio Code is a powerful and versatile code editor that offers a wide range of features and extensions for Java developers. By using Visual Studio Code for Java programming, developers can benefit from features such as code completion, debugging, and live coding. Additionally, with the integration of GitHub Copilot, developers can streamline their coding process with AI-assisted suggestions for code snippets and functions. This blog will provide a comprehensive guide for setting up and using these tools for Java development. Contents [ hide ] Setup Visual Studio Code for Java and Spring Visual Studio Code (VS Code) is an open-source code editor that supports a wide range of programming languages, including Java. It is a powerful tool
Read more

Java interview questions - Must to know concepts

Contents [ hide ] How does Java achieve platform independence, and what is the underlying principle? Java programs can run on diverse operating systems and hardware setups without requiring modification. This feat is primarily achieved through the concept of the Java Virtual Machine (JVM). The Java Virtual Machine (JVM) The JVM acts as a bridge between the Java code you write and the underlying hardware and operating system . When you compile your Java code, it is translated into an intermediate form called bytecode, which is not tied to any specific platform. The JVM then comes into play. It takes this bytecode and dynamically translates it into machine-specific instructions that the host system can execute. This means that a Java program can be written once and executed on any system with the appropriate JVM for that system. Example: Running a Java Program on Different Platforms Consider a simple Java program that calculates the sum of two numbers: package codeKatha
Read more

Spring Data JPA

Image
Introduction- We will learn here Spring Data JPA, perform CRUD operation, Clear concept of Relationship mapping like one-to-many, many-to-one with Example. Spring Data JPA is a powerful framework that simplifies the process of working with relational databases in Java applications. It provides an easy-to-use API for working with JPA, allowing developers to focus on their business logic instead of worrying about the details of how JPA works. With Spring Data JPA, you can easily define entities that map to database tables, and then use them to perform CRUD (create, read, update, delete) operations on those tables. In addition, Spring Data JPA provides support for more advanced features like querying and pagination, making it an excellent choice for both small and large projects. Contents [ hide ] In this blog, we will explore Spring Data JPA by building a sample application that uses it to manage users and packs. But, before let
Read more

Data Structures & Algorithms Tutorial with Coding Interview Questions

Image
About the Course This course offers comprehensive coverage of coding questions that serve as a solid foundation for understanding DSA concepts. These questions are frequently asked in coding interviews, either directly or with some variations, by many companies, including Adobe, Facebook (Meta), Paytm, Amazon, Google, and others. Our primary objective is to enhance your problem-solving skills and enable you to devise optimal solutions. The course includes a wide range of topics, such as Arrays, Strings, Searching and Sorting, Greedy Algorithms, Trees, Graphs, Dynamic Programming, and more. Upon completion, you will possess the necessary skills to ace DSA interviews for typical companies or excel in the initial rounds of product-based companies such as Google, Microsoft and similar others. We are started with Graph data Structure and add others soon. Contents [ hide ] Approach Our course is  organised into chapters that foll
Read more

Elasticsearch Java Spring Boot

Image
Introduction- In this blog, we will learned how to use Elasticsearch with Spring Boot to build a search application. We will created several classes as an example, including ElasticsearchConfig, Book, BookService, BookController, and BookRepository, to demonstrate how to use Elasticsearch with Spring Boot. After this tutorial, you can start building your own search application using Elasticsearch and Spring Boot. Elasticsearch is a powerful search and analytics engine that can be used to build highly scalable and fault-tolerant applications. In this blog, we will learn how to use Elasticsearch with Spring Boot to build a search application. First we will Set up a Spring Boot project with Elasticsearch after that we will see how to make connection with elasticsearch. Once connection setupt is done then we will add data then perform queries and searching on Elasticsearch. Contents [ hide ] Setting up a Spring Boot project with Elas
Read more

Java interview questions for 5 years experience

Contents [ hide ] What is difference between Heap and Stack Memory in Java, and shed light on their utilization? In Java, memory management plays a crucial role in determining how objects are stored and accessed during program execution . Heap and Stack Memory are two distinct regions where different types of data are managed. Understanding their differences is essential for efficient memory utilisation and managing object lifecycles. Stack Memory Stack Memory is a region used for storing method calls, local variables, and references to objects . It operates in a Last-In-First-Out (LIFO) manner , resembling a stack of items. Each method call creates a new frame in the stack, containing variables specific to that method. Stack Memory is relatively fast for allocation and deallocation because it follows a strict order. However, it has limited space and is typically used for small, short-lived data. Primitive data types and references to objects are often stored here. Ex
Read more