Problem
Given: A simple directed acyclic graph with vertices in the edge list format.
Return: A topological sorting (i.e., a permutation of vertices) of the graph.
返回:图的拓扑排序(即,顶点的排列)。
Sample Dataset
4 5 1 2 3 1 3 2 4 3 4 2
Sample Output
4 3 1 2