LintCode：拓扑排序

拓扑排序：

graph 节点结构：

public class DirectedGraphNode {
      public int label;
      public ArrayList<DirectedGraphNode> neighbors;
      public DirectedGraphNode(int x) { 
        label = x; neighbors = new ArrayList<DirectedGraphNode>(); 
      }
}

排序：每次输出入度为0的节点：

public ArrayList<DirectedGraphNode> topSort(ArrayList<DirectedGraphNode> graph) {
        // write your code here
        ArrayList<DirectedGraphNode> result = new ArrayList<>();
        HashMap<DirectedGraphNode, Integer> map = new HashMap<>();
        for (DirectedGraphNode node:graph){
            for(DirectedGraphNode ner:node.neighbors){
                if(map.containsKey(ner)){
                    map.put(ner,map.get(ner)+1);
                }else {
                    map.put(ner,1);
                }
            }
        }
        Queue<DirectedGraphNode> q = new LinkedList<>();
        for(DirectedGraphNode node : graph){
            if(!map.containsKey(node)){
                q.offer(node);
                result.add(node);
            }
        }
        while (!q.isEmpty() ){
            DirectedGraphNode node = q.poll();
            for (DirectedGraphNode ner:node.neighbors){
                if(map.get(ner)==1){
                    q.offer(ner);
                    result.add(ner);
                    map.remove(ner);
                }else {
                    map.put(ner, map.get(ner)-1);
                }
            }
        }
        return result;
    }