最短路之Dijkstra---HDU1874

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1874

Dijkstra算法的模板题/(ㄒoㄒ)/~~

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=210;
const int MAX=0x3f3f3f3f;
int map[MAXN][MAXN];
int vis[MAXN];
int dis[MAXN];
int S,E,N,M;
int st,ed,val;
void shortPath_DIJ(int start)
{
    int minn,k;
    for(int i=0;i<N;i++)
        dis[i]=(i==start?0:MAX);
    for(int i=0;i<N;i++)
    {
        minn=MAX;
        for(int j=0;j<N;j++)
        {
            if(!vis[j]&&dis[j]<=minn)
            {
                minn=dis[j];
                k=j;
            }
        }
        vis[k]=1;
        for(int q=0;q<N;q++)
            dis[q]=min(dis[q],dis[k]+map[k][q]);
    }

}
int main()
{
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        memset(vis,0,sizeof(vis));
        memset(map,0,sizeof(map));
        memset(dis,0,sizeof(dis));
        for(int i=0;i<N;i++)
            for(int j=0;j<N;j++)
                map[i][j]=MAX;
        while(M--)
        {
            scanf("%d%d%d",&st,&ed,&val);
            if(map[st][ed]>val)
            map[st][ed]=map[ed][st]=val;
        }
        scanf("%d%d",&S,&E);
        shortPath_DIJ(S);
        printf("%d\n",dis[E]==MAX?-1:dis[E]);
   }
   return 0;
}

仅代表个人观点，欢迎交流探讨，勿喷~

PhotoBy:WLOP

http://weibo.com/wlop