最短路路径还原

最新推荐文章于 2021-10-21 21:46:38 发布

呵呵---哈哈---嘻嘻

最新推荐文章于 2021-10-21 21:46:38 发布

阅读量400

点赞数

CC 4.0 BY-SA版权

分类专栏：基础

本文链接：https://blog.youkuaiyun.com/u011867401/article/details/40057023

基础专栏收录该内容

8 篇文章

订阅专栏

本文介绍了使用Prim算法解决最小生成树问题的过程，包括输入数据处理、算法实现及输出结果展示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define inf 100000
using namespace std;
int n, m, d[100], pre[100], dis[100][100];
bool vis[100];
int main(){
    int i, j;
    while(scanf("%d%d", &n, &m) == 2){
        memset(vis, 0, sizeof(vis));
        memset(pre, -1, sizeof(pre));
        for(i = 1; i <= n; i++)
            d[i] = inf;
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                dis[i][j] = inf;
        int a, b, c;
        for(i = 1; i <= m; i++){
            scanf("%d%d%d", &a, &b, &c);
            dis[a][b] = dis[b][a] = min(c, dis[a][b]);
        }
        d[1] = 0;
        while(1){
            int decide = -1;
            for(i = 1; i <= n; i++)
                if(!vis[i])
                    if(decide == -1 || d[i] < d[decide])
                        decide = i;
            if(decide == -1)
                break;
            for(i = 1; i <= n; i++){
                if(!vis[i] && i!=decide){
                    if(d[i] > d[decide]+dis[decide][i]){
                        pre[i] = decide;
                        d[i] = d[decide]+dis[decide][i];
                    }
                }
            }
            vis[decide] = 1;
        }
        int pp = n;
        int ans[100], tot = 0;
        while(pp != -1){
            ans[++tot] = pp;
            pp = pre[pp];
        }
        for(i = tot; i >= 1; i--)
            printf("%d ", ans[i]);
        printf("\n");
    }
    return 0;
}