Master Topological Sort, the ordering of a directed acyclic graph so every edge points forward. Compute in-degrees, build an order with Kahn's algorithm in your language of choice, detect cycles, and find the longest path in a DAG.
Prerequisites:
- Knowledge of a programming language of your choice.
- Basic understanding of directed graphs.
