Topological Sort (Kahn's Algorithm)

interactive DAG generation · Zero in-degree queue · Removal order

Algorithm Notes

Summary: Topological sort using indegrees and a queue.
Time: O(V+E)
Space: O(V)
Use: DAG scheduling, dependency resolution; detects cycles if output size < V.

Big-O Guide

Ready