Dijkstra 无向图
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<deque>
#include<iostream>
using namespace std;
const int INF=0x3f3f3f3f;
const int N=200;
int graph[N][N];
int check[N];
int dis[N];
int n;
void Dijkstra(int u0)
{
int i,p,j;
int inf,mid;
for(i=1; i<=n; i++)
dis[i]=graph[u0][i];
check[u0]=-1;
for(i=0; i<n-1; i++)
{
inf=INF;
mid=u0;
for(j=1; j<=n; j++)
{
if(check[j]!=-1&&dis[j]<inf)
{
inf=dis[j];
mid=j;
}
}
if(inf!=INF)
{
check[mid]=-1;
for(j=1; j<=n; j++)
{
if(check[j]!=-1&&dis[j]>graph[mid][j]+dis[mid])
dis[j]=graph[mid][j]+dis[mid];
}
}
}
}
int main()
{
int m,a,b,c;
int i,p,j;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0)
break;
memset(check,0,sizeof(check));
memset(dis,0,sizeof(dis));
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
if(i==j)
graph[i][j]=0;
else
graph[i][j]=INF;
}
for(i=1; i<=m; i++)
{
scanf("%d%d%d",&a,&b,&c);
graph[a][b]=graph[b][a]=c;
}
Dijkstra(1);
printf("%d\n",dis[n]);
}
return 0;
}