很裸的最短路徑問題，這里用Dijkstra做的，前邊已經寫過Floyd和SPFA算法

SPFA：http://www.cnblogs.com/vongang/archive/2011/08/16/2141334.html

Floyd：http://www.cnblogs.com/vongang/archive/2011/08/16/2141019.html

My Code：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

const int maxnum = 107;
const int inf = 999999;

int dist[maxnum];
int map[maxnum][maxnum];
int vis[maxnum];
int n, m;

void Dijkstra()
{
int i, j;
memset(vis, 0, sizeof(vis));
for(i = 1; i <= n; i++)
{
dist[i] = map[1][i];
vis[i] = 0;
}
dist[1] = 0;
vis[1] = 1;
for(i = 2; i <= n; i++)
{
int flag, min = inf;
for(j = 1; j <= n; j++)
if(!vis[j] && dist[j] < min)
{
flag = j;
min = dist[j];
}
vis[flag] = 1;
for(j = 1; j <= n; j++)
if(!vis[j] && map[flag][j] < inf)
{
int newdist = dist[flag] + map[flag][j];
if(newdist < dist[j])
dist[j] = newdist;
}
}
}
int main()
{
//freopen("data.in", "r", stdin);
int i, j, a, b, c;
while(scanf("%d%d", &n, &m), n||m)
{
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
map[i][j] = inf;
while(m--)
{
scanf("%d%d%d", &a, &b, &c);
if(c < map[a][b])
map[a][b] = map[b][a] = c;
}
Dijkstra();
printf("%d\n", dist[n]);
}
return 0;
}

轉載于:https://www.cnblogs.com/vongang/archive/2011/08/16/2141446.html

總結

以上是生活随笔為你收集整理的HDU_2544 最短路（Dijkstra）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。