题目:
#include<iostream>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 100010;
int n,m;
int e[N],ne[N],w[N],h[N],idx;//用单链表创建图
int dist[N];//记录最短值
bool st[N];//记录当前节点是否在队列里
void add(int a,int b,int c)//建图
{
e[idx] = b;
w[idx] = c;
ne[idx] = h[a];
h[a] = idx++;
}
int spfa()
{
memset(dist,0x3f,sizeof dist);
dist[1] = 0;
queue<int>q;
q.push(1);
st[1] = true;
while(!q.empty())//队列不为空就更新节点
{
int t = q.front();
q.pop();
st[t] = false;
for(int i = h[t];i != -1;i = ne[i])
{
int j = e[i];
if(dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
if(!st[j])q.push(j);//只要某个值被更新了就更新这个节点能到达的节点,接入队列,等待更新
st[j] = true;//记录该节点在队列里
}
}
}
if(dist[n] == 0x3f3f3f3f)return -1;
else return dist[n];
}
int main()
{
cin>>n>>m;
memset(h,-1,sizeof h);
while(m--)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
}
cout<<spfa();
return 0;
}