Feed
Discussions

Topological Sort

Topological Sort

#topological-sort

0 followers·9 articles

Topological Sort

#topological-sort·0 followers·9 articles

Topological Sort

Changelog

New steps component and improved accessibility on Hashnode's blog and docs product.

Nov 05, 2024·

new

Trending Articles

Unlocking the Future of Web3 Communication: Your Guide to the Dmail Network

Nsi Berry·28 reads

Solv Joins TACBuild External Vaults: A New Era for Bitcoin on the Ton Blockchain

WEALTH 💎·25 reads

SolvBTC : Libérer le véritable potentiel du Bitcoin dans la DeFi

WEALTH 💎·32 reads

Top commenters this week

Writing Challenges

#2Articles1Week Challenge

Become better at technical writing; accept Hashnode's writing challenge for four weeks.

#2Articles1Week Challenge

#WomenWhoTech

Share your story, achievements, or experiences as a woman, non-binary folk in tech or as a #WomenWhoTech ally!

#WomenWhoTech

Self Starter

Publish your first article on Hashnode and become a self starter!

Self Starter

Serial Blogger

Publish an article every day for 7 days and earn a cool serial blogger badge!

Serial Blogger

Talk of the town

Write a story that drives amazing engagement on Hashnode and become the talk of the town!

Talk of the town

Word Warrior

Write an in-depth article on your Hashnode blog that's more than 2000 words and become a word warrior!

Word Warrior

Shreyash Shukla

Shreyash Shukla

Noah Blake John

Noah Blake John

Viru singh

Julius Job

Wayne Bedford

Abhi

dynamicprogramming.hashnode.dev·Apr 12, 2025

Apr 12, 2025

Parallel Courses

There are N courses, labelled from 1 to N. We are given relations[i] = [X, Y], representing a prerequisite relationship between course X and course Y: course X has to be studied before course Y. In one semester you can study any number of courses as ...

Parallel Courses

Discuss·3 reads

Teja Illa

akadurga.hashnode.dev·Oct 02, 2024

Oct 02, 2024

Topological Sort Algorithm

Topological sort algorithm using DFS import java.util.*; public class Main { public static class Graph { int v; int e; List<List<Integer>> arrList; public Graph(int v, int e) { this.v = v; this.e = e; arrList...

Discuss·4 reads

Topological Sort

Drake Pham

topological-sort.hashnode.dev·Sep 28, 2024

Sep 28, 2024

Topological Sort: Understanding the Concept and 2 Applications

Topological Sorting is an important concept in graph theory, especially for Directed Acyclic Graphs (DAGs). It gives a linear order of vertices so that for every directed edge u → v, vertex u comes before v in the order. This is useful when tasks or ...

Topological Sort: Understanding the Concept and 2 Applications

Discuss·13 reads

Jyotiprakash Mishra

Jyotiprakash Mishra

blog.jyotiprakash.org·Sep 25, 2024

Sep 25, 2024

Introduction to Graphs

A graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs are an abstract data structure used to represent relationships between objects. A graph G is typically denoted as G = (V, E), where: V is the set o...

Discuss·10 likes·1650 reads

Fatima Jannet

mahia.hashnode.dev·Aug 22, 2024

Aug 22, 2024

Topological Sort Algorithm

Topological sort is crucial in scenarios like task scheduling, resolving symbol dependencies in compilers, and determining build orders in software projects. This is going to be a quick blog on the Topological Sort Algorithms. Let's start! Topologica...

Topological Sort Algorithm

Discuss·24 reads

Python Data Structure and Algorithm - DSA

Topological Sort

Ajay Dandge

blog.ajaydandge.dev·Jul 22, 2024

Jul 22, 2024

LeetCode #2392 Build a Matrix With Conditions, Topological Sort and Kahn's Algorithm

You are given a positive integer k. You are also given: a 2D integer array rowConditions of size n where rowConditions[i] = [above<sub>i</sub>, below<sub>i</sub>], and a 2D integer array colConditions of size m where colConditions[i] = [left<sub>i<...

Discuss·8 reads

Vineeth Chivukula

Vineeth Chivukula

vineethchivukula.hashnode.dev·Jun 25, 2024

Jun 25, 2024

Understanding the Topological Sort algorithm

Topological Sort is a linear ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge 𝑢→𝑣, vertex 𝑢 comes before 𝑣 in the ordering. This pattern is particularly useful in problems involving scheduling, dependency r...

Discuss·4 reads

Topological Sort

Saurabh Dhingra

Saurabh Dhingra

saurabhdhingraa.hashnode.dev·Jun 30, 2023

Jun 30, 2023

Topological Sort - Taking Graph Theory to life

How many times do you get muddled about what sequence of subtasks you should follow to complete a bigger one and wonder if there was a way to find that out? Computer Science is all about taking abstract problems like these and solving them by reducin...

Topological Sort - Taking Graph Theory to life

Discuss·65 reads

Topological Sort

khandoker anan

blog.khandokeranan.com·May 06, 2023

May 06, 2023

Finding the shortest path with topological sort in Directed Acyclic Graph

Introduction In a directed acyclic graph (DAG), a topological sort is a linear ordering of the vertices such that for every directed edge, the vertex u comes before v in the ordering. This ordering can be used to find the shortest path between two ve...

Finding the shortest path with topological sort in Directed Acyclic Graph

Discuss·4 likes·170 reads