拓扑排序

最新推荐文章于 2022-07-12 21:36:19 发布

点解质

最新推荐文章于 2022-07-12 21:36:19 发布

阅读量134

点赞数

分类专栏：数据结构与算法文章标签：拓扑排序宽度优先搜索

本文链接：https://blog.csdn.net/yuanshine/article/details/82081014

版权

数据结构与算法专栏收录该内容

5 篇文章 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;
        
        unordered_map<DirectedGraphNode*, int> node_indegrees;
        for (auto node : graph)
        {
            vector<DirectedGraphNode*> neighbors = node->neighbors;
            for (auto neighbor : neighbors)
            {
                node_indegrees[neighbor]++;
            }
        }
        
        queue<DirectedGraphNode*> nodes;
        for (auto node : graph)
        {
            if (node_indegrees[node] == 0)
            {
                nodes.push(node);
                result.push_back(node);
            }
        }
        
        while (!nodes.empty())
        {
            DirectedGraphNode* node = nodes.front();
            nodes.pop();
            
            for (auto neighbor : node->neighbors) 
            {
                node_indegrees[neighbor]--;
                if (node_indegrees[neighbor] == 0) 
                {
                    nodes.push(neighbor);
                    result.push_back(neighbor);
                }
            }
        }
        
        return result;
    }
};