这个代码适合稠密图,也就是用邻接矩阵来存储的图
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int n,m;
int a,b,c;
const int N = 510;
int g[N][N];
int dist[N];
bool st[N];
int dijkstra()
{
dist[1] = 0;
for(int i = 0;i <n;i++)
{
int t = -1;
for(int j = 1;j<=n;j++)
{
if(!st[j]&&(t==-1||dist[t]>dist[j])) t = j;
}
st[t] = true;
for(int j = 1;j<=n;j++)
{
dist[j] = min(dist[j],dist[t] + g[t][j]);
}
}
if(dist[n] == 0x3f3f3f3f)return -1;
return dist[n];
}
int main()
{
memset(g,0x3f,sizeof g);
memset(dist,0x3f,sizeof dist);
scanf("%d%d",&n,&m);
while(m--)
{
cin >> a>> b>>c;
g[a][b] = min(g[a][b],c);
}
int t = dijkstra();
cout << t << endl;
return 0;
}