Problem 8 - Graph Algorithms

A directed graph $G=(V,E)$ with vertex set $V$ and edge set $E$ is acyclic if there is no directed cycle. Develop a linear-time algorithm, base on the depth-first search, to discern whether a given directed graph is acyclic or not and further execute a topological sort.

See [SED00] for a detailed answer.