Topological Sort (Kahn's)
Linearly order vertices of a Directed Acyclic Graph (DAG) such that for every directed edge (u, v), u comes before v.
Drag from node to node to create dependencies. Note: Cycles will break the sort.
📜 Execution Log
Ready. Connections represent dependencies (e.g. 1 must finish before 2).
📊 In-Degree Table
| Node | In-Degree |
|---|