Dijkstra 求最短路

#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;#define maxx 10010int c[maxx][maxx];int dist[maxx];int Dijkstra(int n,int v,int dist[]){    bool s[maxx];    for(int i=0;i<n;i++)        {            dist[i]=c[v][i];            s[i]=0;        }    dist[v]=0;    s[v]=1;    for(int i=1;i<n;i++)    {        int tmp=maxx;        int u=v;        for(int j=0;j<n;j++)            if(!s[j]&&dist[j]<tmp)            {                u=j; tmp=dist[j];            }        s[u]=1;        for(int j=0;j<n;j++)            if(!s[j]  &&c[u][j]<maxx)            {            int newdist=dist[u]+c[u][j];            if(newdist<dist[j]){                dist[j]=newdist;            }        }    }}int main(){    int i,j,n,m,v,u,d;    while(~scanf("%d%d",&n,&m))    {        for(i=0;i<n;i++)            for(j=0;j<n;j++)            c[i][j]=maxx;        for(i=0;i<m;i++)        {            scanf("%d%d%d",&u,&v,&d);            if(d<c[u][v]){                c[u][v]=d;                c[v][u]=d;            }        }        int a,b;        scanf("%d%d",&a,&b);        for(i=0;i<=n;i++)            dist[i]=maxx;         Dijkstra(n,0,dist);         if(dist[n-1]==maxx)  cout<<"There is a tie!"<<endl;         else             printf("%0.1lf %0.1lf\n",(dist[n-1]*1.0/a)+10,dist[n-1]*1.0/b);    }    return 0;}