算法复习6.3拓扑排序

HineMusk

于 2024-01-29 00:24:14 发布

阅读量87

点赞数 2

分类专栏：算法复习文章标签：算法

本文链接：https://blog.csdn.net/2302_79123319/article/details/135903149

版权

算法复习专栏收录该内容

153 篇文章

订阅专栏

std::vector<int> topologicalSort(std::unordered_map<int, std::vector<int>>& graph) {
    std::unordered_map<int, int> inDegree;
    for (const auto& node : graph) {
        inDegree[node.first] = 0;
    }
    for (const auto& node : graph) {
        for (int neighbor : node.second) {
            inDegree[neighbor]++;
        }
    }

    std::queue<int> q;
    for (const auto& entry : inDegree) {
        if (entry.second == 0) {
            q.push(entry.first);
        }
    }

    std::vector<int> result;
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        result.push_back(node);
        for (int neighbor : graph[node]) {
            inDegree[neighbor]--;
            if (inDegree[neighbor] == 0) {
                q.push(neighbor);
            }
        }
    }

    if (result.size() == graph.size()) {
        return result;
    } else {
        
        return {};
    }
}