摘要：该算法可用于计算正权图上的单源最短路（SSSP），即从单个点源出发，到所有结点的最短路。（同时适用于有向图和无向图）memset(v,0,sizeof(v));//标记点是否找过；for(i=0;i<n;i++){ d[i]=(i==0?0:INF);//INF代表无穷}for(i=0;i<n;i++){ int x,m=INF; for(y=0;y<n;y++) if(v[y]==0&&d[y]<m) { m=d[x=y]; } v[x]=1; for(y=0;y<n;y++) { if(d[y]>d[x]+w[x][y]) d[y]=d[ 阅读全文

摘要：DescriptionOne cow from each ofNfarms (1 ≤N≤ 1000) conveniently numbered 1..Nis going to attend the big cow party to be held at farm #X(1 ≤X≤N). A total ofM(1 ≤M≤ 100,000) unidirectional (one-way roads connects pairs of farms; roadirequiresTi(1 ≤Ti≤ 100) units of time to traverse.Each cow must walk 阅读全文