第十天，最短路径

题意：告诉你边数m,点数n，接下来m行点，点，距离，求1~n的最短距离
但是要考虑重边,即2到3可能不止一条路，只需记录最短的那条路，用迪杰斯特拉
有关最短路

#include
#include
#include
int dis[1005];
int s[1005][1005];
int book[1005], min;
int main()
{
int n, m, i, j, a, b, c, u, k;
memset(dis, 0, sizeof(dis));
memset(book, 0, sizeof(book));
cin>>m>>>n;
for (i = 0; i <= n; i++)
for (j = 0; j <= n; j++)
if (i == j)
s[i][j] = 0;
else
s[i][j] = 99999999;
for (i = 1; i <= m; i++)
{
cin>>a>>b>>c;
if (c < s[a][b])//如果同样的路径，但距离更短，使用短的
{
s[a][b] = c;//双向导通
s[b][a] = c;
}
}
for (i = 2; i <= n; i++)
dis[i] = s[1][i];
book[1] = 1;//从第0个开始
for (i = 1; i <= n - 1; i++)
{
min = 99999999;
for (j = 1; j <= n; j++)
if ((min > dis[j]) && (!book[j]))
{
min = dis[j];
u = j;
}
book[u] = 1;
for (k = 1; k <= n; k++)
if (dis[u] + s[u][k] < dis[k])//如果中间绕一下比直接去更短
{
dis[k] = dis[u] + s[u][k];//就刷新路径长度
}
}
cout<<dis[n]<<endl;
return 0;