Topic: Language Problem / Level: advanced

Problem: Write a program to perform a topological sort of a directed acyclic graph (DAG).

Run the code to see the output here...