[Algorithm][Graph] Topological sort

Topological-Sort(G)

1. call DFS(G) to compute finishing times v.f for each vertex v
2. as each vertex is finished, insert in onto the front of a linked list
3. return the linked list of vertices

Problem:

• 269. Alien Dictionary: https://leetcode.com/problems/alien-dictionary/description/