🎮 Controls
📥 Queue (In-degree 0)
Nodes with no dependencies
✅ Topological Order
Completed tasks appear here...
💡 Kahn's Algorithm
1. Start with nodes having in-degree 0
2. Process node, reduce neighbors' in-degree
3. Add new 0-indegree nodes to queue
4. Repeat until done