Bellman-Ford的队列优化(无向图有向图)模板

# if 01
# include <iostream>
# include <numeric>
# include <algorithm>
# include <functional>
# include <list>
# include <map>
# include <set>
# include <stack>
# include <deque>
# include <queue>
# include <vector>
# include <ctime>
# include <cstdlib>
# include <cmath>
# include <string>
# include <cstring>
# include <iomanip>
# include <cstdio>
using namespace std;
# define ll long long int
const int maxn = 1e5 + 3000;
const int inf = 0x3f3f3f3f;
int n, m;
int u[maxn], v[maxn], w[maxn];
int first[maxn], ne[maxn];
int dis[maxn], flag[maxn];
int s,t;//起点源点
void fun1()
{
    memset(u, false, sizeof(u));
    memset(v, false, sizeof(v));
    memset(w, false, sizeof(w));
    memset(first, -1, sizeof(first));
    memset(ne, -1, sizeof(ne));
}
void fun2()
{
    memset(dis, inf, sizeof(dis));
    memset(flag, false, sizeof(flag));
}
# if 01
inline int quick_read()//快读
{
	char ch;
	int f=1,res=0;
	while((ch=getchar())<'0'||ch>'9')
		if(ch=='-') f=-1;
	while(ch>='0'&&ch<='9')
	{
		res=(res<<1)+(res<<3)+(ch^48);//注意位运算的优先级别
		ch=getchar();
	}
	return f*res;
}
#endif // 0
void read()
{
    for(int i=1;i<=m; i++)
	{
		cin >> u[i]>> v[i] >> w[i];
		ne[i] = first[u[i]];
		first[u[i]] = i;
	}
	 //双向路劲
    for(int i = m + 1; i <= m * 2; i++)
    {
        u[i] = v[i - m];
        v[i] = u[i - m];
        w[i] = w[i - m];
        ne[i] = first[u[i]];
        first[u[i]] = i;
    }
}
void spfa(int start)
{
    queue<int> q;
	q.push(start);
	flag[start]=1;
	while(!q.empty())
    {
		int x=q.front();
		q.pop();
		flag[x]=0;
		for(int i=first[x];i != -1;i=ne[i])
		{
          if(dis[v[i]] > dis[u[i]] + w[i])
			{
				dis[v[i]] = dis[u[i]]+w[i];
				if(!flag[v[i]]) flag[v[i]]=1,q.push(v[i]);
			}
		}
	}
}

int main()
{
    ios_base::sync_with_stdio(false);
    std::cin.tie(0);
	while(cin >> n >> m >> s >> t)
    {
        fun1();
        fun2();
        read();
        dis[s]=0;
        spfa(s);
        cout << dis[t] << endl;
    }
	return 0;
}

#endif