Node:最短路径算法之Dijkstra

来源：互联网发布：网页被js篡改编辑：程序博客网时间：2024/05/20 06:05
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>#include <stack>#include <queue>#define flush(arr,i) memset(arr,i,sizeof(arr))#define INF 0xfffffffusing namespace std;const int maxn=1010;//到节点的距离和第i个节点的前一个节点int dis[maxn], pre[maxn];//边集int cost[maxn][maxn];//是否在集合之中bool vis[maxn];int n, m, s;/*测试数据---------8 14 66 5 16 4 36 7 65 3 35 4 17 4 17 2 44 2 93 4 13 1 41 2 17 8 142 8 23 2 2--------*///数据录入和初始化void initMap(){    //没有进入集合    flush(vis, 0);    scanf("%d%d%d", &n, &m, &s);    int from, to, len;    for(int i = 1; i <= n; i++)    {        dis[i] = INF;        pre[i] = 0;        for(int j = 1; j <= n; j++)            cost[i][j] = INF;    }    for(int i = 0; i < m; i++)    {        scanf("%d%d%d",&from, &to, &len);        printf("%c %c %d\n",from + 'r', to + 'r', len);        cost[from][to] = cost[to][from] = len;    }}//路径输出void showPath(int cur){    if(pre[cur])        showPath(pre[cur]);    printf("->%c", cur + 'r');}//优化集中在这一部分int getMinmunNode(){    int maxCost = INF, pos = -1;    for(int i = 1; i <= n; i++)        if(!vis[i] && dis[i] < maxCost)        {            pos = i;            maxCost = dis[i];        }    //加入集合标记为1    vis[pos] = 1;    return pos;}void Dijkstra(int s){    dis[s] = 0;    //一共更新n次    for(int i = 1; i <= n; i++)    {        //获取当前的is最小节点进行下一步更新        int cur = getMinmunNode();        //输出当前选出的节点        printf("cur %c\n", cur + 'r');        for(int j = 0; j <= n; j++)            //满足更新条件            if(dis[j] > dis[cur] + cost[cur][j])        {            dis[j] = dis[cur] + cost[cur][j];            //维护路径            pre[j] = cur;            //输出更新情况            printf("%c->%c:%d ", s + 'r', j + 'r', dis[j]);        }        printf("\n");    }    for(int i = 1; i <= n; i++)    {        showPath(i);        printf(" %d\n",dis[i]);    }}int main(){    freopen("data.txt","r",stdin);    initMap();    Dijkstra(s);    return 0;}
0 0