Topological sort is a linear ordering of the vertices in a directed acyclic graph (DAG) such that for every directed edge u -> v, vertex u comes before vertex v in the ordering. This concept is used ...

The topological sorting can be implemented with the induction-based or the DFS-based algorithms. We demonstrated both algorithms with examples in the lecture. Your task in this project is to implement ...