Topological Sort (Kahn)

Schedule tasks with dependencies.

Given edges (a, b) meaning "a must come before b", produce an order that respects every edge. Used by build systems, package managers, and module loaders.

main.py

Output

Press Run to execute.

Expected output

['a', 'b', 'c', 'd']