Lintcode:拓扑排序(深度优先搜索，广度优先搜索)

//广度优先搜索(BFS)

vector<DirectedGraphNode*> topSort(vector<DirectedGraphNode*> graph) {  
        vector<DirectedGraphNode*> ret;  
        if(graph.empty())  
            return ret;  
          
        map<DirectedGraphNode*,int> in; //in为入度  
        queue<DirectedGraphNode*>   s;  //保存入度为零的节点  
        for(auto e:graph){  
            for(auto i:e->neighbors)  
                ++in[i];              //记录每个节点的入度  
        }  
          
        for(auto e:graph)  
           if(0==in[e])  
               s.push(e);         //入度为零的节点入栈  
          
        while(!s.empty()){        //BFS遍历,搜寻入度为零的节点  
            DirectedGraphNode* cur=s.front();  
            s.pop();             //当前节点出栈时，它的相邻节点入度都减一  
            ret.push_back(cur);     
            for(auto e:cur->neighbors){