简化SPFA模板

用邻接表存图，在代码“注意1”处就不用遍历n个边，更快，所以这个模板算是个简化的模板

#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;
#define maxn 205
#define INF 0x3f3f3f3f
int vis[maxn], dis[maxn];
int ma[maxn][maxn];
int n, m, u, v, x, st, en;
int spfa(int st, int en)
{
    queue<int>q;
    q.push(st);
    vis[st] = 1;
    dis[st] = 0;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = 0;//vis是用来判断某个点是否在队列里面，所以这里一出队就vis置0
        for (int i = 0; i < n; i++)//注意1
        {
            if (ma[u][i] < INF&&dis[i] > dis[u] + ma[u][i])
            {
                dis[i] = dis[u] + ma[u][i];
                if (!vis[i])
                {
                    q.push(i);
                    vis[i] = 1;
                }
            }
        }
    }
    return dis[en];
}

int main()
{
    while (scanf("%d%d", &n, &m) != EOF)
    {
        memset(ma, INF, sizeof(ma));
        memset(vis, 0, sizeof(vis));
        memset(dis, INF, sizeof(dis));
        for (int i = 0; i < n; i++)
        {
            ma[i][i] = 0;
        }
        for (int i = 0; i < m; i++)
        {
            int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            if (c < ma[a][b])
            {
                ma[a][b] = c;
                ma[b][a] = c;
            }
        }
        scanf("%d%d", &st, &en);
        int ans = spfa(st, en);
        if (ans < INF)
            printf("%d\n", ans);
        else printf("-1\n");
    }
}