spfa最短路

思路：

   spfa算法求最短路和dijkstra算法的区别在于D算法在求最短路时，是每次取队列中到源点最小的点 ，visit数组的状态不可以改变，而S算法是每次把被松弛的所有点放进去，visit数组可以改变，visit代表该点是否在队列中，这也Spfa算法可以求负环的原因

 

#include <bits/stdc++.h>
#define N 500010
using namespace std;

int head[N], nxt[N], edge[N], weight[N], dis[N], idx = 1;
bool vis[N];
int n, m, x, y, z;

void add(int s, int d, int w) //链式前向星
{
    edge[idx] = d;
    weight[idx] = w;
    nxt[idx] = head[s];
    head[s] = idx++;
}
void spfa()
{
    queue<int> q;
    dis[1] = 0;
    vis[1] = true; // vis是判断该点是不是在队列中
    q.push(1);
    while (!q.empty())
    {
        int cur = q.front();
        q.pop();
        vis[cur] = false;
        for (int i = head[cur]; i != -1; i = nxt[i])
        {
            int des = edge[i];
            if (dis[des] > dis[cur] + weight[i])
            {
                dis[des] = dis[cur] + weight[i];
                if (!vis[des])
                {
                    q.push(des);
                    vis[des] = true;
                }
            }
        }
    }
}
int main()
{
    cin >> n >> m;
    memset(head, -1, sizeof(head));
    for (int i = 1; i <= n; i++)
    {
        dis[i] = INT_MAX;
        vis[i] = false;
    }
    for (int i = 0; i < m; i++)
    {
        cin >> x >> y >> z;
        add(x, y, z);
    }
    spfa();
    if (dis[n] == INT_MAX)
    {
        cout << "impossible" << endl;
    }
    else
        cout << dis[n] << endl;
    return 0;
}