LintCode-127.Topological Sorting
[http://www.lintcode.com/en/problem/topological-sorting/]
Given an directed graph, a topological order of the graph nodes is defined as
follow:
For each directed edge A -> B in graph, A must before B in the order list.
The first node in the order can be