🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
📝 **Question:** Implement `topo(graph)` for a DAG (raise ValueError on cycle). Use `{'a':['b','c'],'b':['d'],'c':['d'],'d':[]}`. Print one valid topo order.
📋 Pick the right answer.
💡 **Hint:** Re-read the theory above if unsure.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.