LintCode 127. Topological Sorting

有向图的拓扑排序，主要应用是“判断图中是否有环”

1. 计算每个节点的入度，即有几个点指向它
2. 将入度为0的点删掉，然后将其相邻的neighbor的入度减一
3. 不断重复2步骤，如最后剩下点表示有环，如无环则不会剩下点

本题让求任意的拓扑排序，以下解题步骤：

• 遍历点，用Hashmap记录每个点的入度
• 将入度为0的所有点加入队列q
• 不断pop队列构造排序，将相关点入度减一，重复加入当前入度为0的点
• 直到队列为空截止

/**
 * Definition for Directed graph.
 * struct DirectedGraphNode {
 *     int label;
 *     vector<DirectedGraphNode *> neighbors;
 *     DirectedGraphNode(int x) : label(x) {};
 * };
 */

class Solution {
public:
    /*
     * @param graph: A list of Directed graph node
     * @return: Any topological order for the given graph.
     */
    vector<DirectedGraphNode*> topSort(vector<DirectedGraphNode*>& graph) {
        vector<DirectedGraphNode *> result;
        if (graph.empty()) {
            return result;
        }
        
        unordered_map<DirectedGraphNode *, int> in_degree;
        for (DirectedGraphNode * node: graph) {
            for (DirectedGraphNode * neighbor: node->neighbors) {
                if (in_degree.find(neighbor) == in_degree.end()) {
                    in_degree[neighbor] = 1;
                } else {
                    in_degree[neighbor]++;
                }
            }
        }
        
        queue<DirectedGraphNode *> q;
        for (DirectedGraphNode * node: graph) {
            if (in_degree.find(node) == in_degree.end()) {
                q.push(node);
            }
        }
        
        while(!q.empty()) {
            DirectedGraphNode * head = q.front();
            q.pop();
            result.push_back(head);
            for (DirectedGraphNode *neighbor: head->neighbors) {
                in_degree[neighbor]--;
                if (in_degree[neighbor] == 0) {
                    q.push(neighbor);
                }
            }
        }
        return result;
    }
};