代码随想录day58 拓扑排序精讲 dijkstra（朴素版）精讲

最新推荐文章于 2024-09-03 18:29:17 发布

咸鱼的自我变强之路

最新推荐文章于 2024-09-03 18:29:17 发布

阅读量188

点赞数 3

分类专栏：代码随想录_刷题文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_45461296/article/details/141750539

版权

代码随想录_刷题专栏收录该内容

61 篇文章 0 订阅

订阅专栏

代码随想录day58 拓扑排序精讲 dijkstra（朴素版）精讲

117. 软件构建

代码随想录

#include <iostream>
#include <unordered_map>
#include <vector>
#include <queue>

using namespace std;

int main() {
    int N, M, S, T;
    cin >> N >> M;
    vector<int> result;
    unordered_map<int, vector<int>> umap;
    vector<int> inorder(N, 0);
    for (int i = 0; i < M; i++) {
        cin >> S >> T;
        inorder[T]++;
        umap[S].push_back(T);
    }
    queue<int> que;
    for (int i = 0; i < N; i++) {
        if (inorder[i] == 0) {
            que.push(i);
        }
    }
    while (!que.empty()) {
        int cur = que.front();
        que.pop();
        result.push_back(cur);
        vector<int> files = umap[cur];
        if (!files.empty()) {
            for (int i = 0; i < files.size(); i++) {
                inorder[files[i]]--;
                if (inorder[files[i]] == 0) {
                    que.push(files[i]);
                }
            }
        }
    }
    if (result.size() != N) {
        cout << -1;
    } else {
        for (int i = 0; i < N - 1; i++) {
            cout << result[i] << " ";
        }
        cout << result[N - 1];
    }
    return 0;
}

dijkstra（朴素版）精讲

#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int main() {
    int n, m, p1, p2, val;
    cin >> n >> m;

    vector<vector<int>> grid(n + 1, vector<int>(n + 1, INT_MAX));
    for(int i = 0; i < m; i++){
        cin >> p1 >> p2 >> val;
        grid[p1][p2] = val;
    }

    int start = 1;
    int end = n;

    std::vector<int> minDist(n + 1, INT_MAX);

    std::vector<bool> visited(n + 1, false);

    minDist[start] = 0; 

    //加上初始化
    vector<int> parent(n + 1, -1);

    for (int i = 1; i <= n; i++) {

        int minVal = INT_MAX;
        int cur = 1;

        for (int v = 1; v <= n; ++v) {
            if (!visited[v] && minDist[v] < minVal) {
                minVal = minDist[v];
                cur = v;
            }
        }

        visited[cur] = true;

        for (int v = 1; v <= n; v++) {
            if (!visited[v] && grid[cur][v] != INT_MAX && minDist[cur] + grid[cur][v] < minDist[v]) {
                minDist[v] = minDist[cur] + grid[cur][v];
                parent[v] = cur; // 记录边
            }
        }

    }

    // 输出最短情况
    for (int i = 1; i <= n; i++) {
        cout << parent[i] << "->" << i << endl;
    }
}