#include<bits/stdc++.h>
using namespace std;
const int N = 510,INF = 0x3f3f3f3f;
int g[N][N];
int dist[N];
bool st[N];
int n,m;
int dijkstra(){
dist[1] = 0;
for(int i = 1;i<=n;i++){
int t = -1;
for(int j = 1;j<=n;j++){
if(st[j]==false&&(t==-1||dist[t]>dist[j]))t = j;
}
for(int j = 1;j<=n;j++){
dist[j] = min(dist[j],dist[t]+g[t][j]);
}
st[t] = true;
}
if(dist[n]==INF)return -1;
else return dist[n];
}
int main(){
memset(dist,INF,sizeof dist);
memset(g,INF,sizeof g);
scanf("%d%d",&n,&m);
for(int i = 1;i<=m;i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
g[a][b] = min(g[a][b],c);
}
cout<<dijkstra();
}
Dijkstra求最短路 I
最新推荐文章于 2024-07-10 16:47:58 发布