Skip to content
AlgoVisual
Back to Home

Topological Sort

2 practice problemsInteractive visual guide

Topological Sort orders nodes in a directed graph so every edge u -> v places u before v.

Key Ideas

  • Works only for DAGs (directed acyclic graphs).
  • Two common approaches: Kahn's algorithm (in-degrees) or DFS postorder.
  • If you cannot process all nodes, there is a cycle.

Practice Problems

Course Schedule II

Medium

LeetCode: https://leetcode.com/problems/course-schedule-ii/

Start Solving

Find All Possible Recipes from Given Supplies

LeetCodeMedium

LeetCode: https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/

Start Solving