spfa求最短路模板（邻接表）

最新推荐文章于 2022-02-20 20:34:11 发布

斌同学斌同學

最新推荐文章于 2022-02-20 20:34:11 发布

阅读量455

点赞数

分类专栏：最短路问题文章标签：图论最短路

本文链接：https://blog.csdn.net/GreatJames/article/details/78244614

版权

最短路问题专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <bitset>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
#include <algorithm>
#include <functional>
#define inf 0x3f3f3f3f
#define debug(x) cout<<"---"<<x<<"---"<<endl
typedef long long ll;
using namespace std;
typedef int mytype;
const int NV = 105;
const int NE = 10005 * 2;

mytype dis[NV];
int pre[NV], vis[NV], vcnt[NV], head[NV], ecnt, flag;
struct edge
{
    int v, next;
    mytype l;
} E[NE];
void adde(int u, int v, mytype l)
{
    E[++ecnt].v = v;
    E[ecnt].l = l;
    E[ecnt].next = head[u];
    head[u] = ecnt;
}
void init(int n, int m, int s)
{
    ecnt = 0;
    memset(pre, 0, sizeof(pre));
    memset(vis, 0, sizeof(vis));
    memset(vcnt, 0, sizeof(vcnt));
    memset(head, -1, sizeof(head));
    for (int i = 0; i <= n; i++)
    {
        dis[i] = inf;
    }
    dis[s] = 0;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        mytype l;
        scanf("%d%d%d", &u, &v, &l);
        adde(u, v, l);
        adde(v, u, l);
    }
}
void spfa(int n, int m, int s)
{
    queue<int> q;
    vis[s] = 1;
    q.push(s);
    flag = 0;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = 0;
        if (vcnt[u] >= n)
        {
            flag = 1;
            break;
        }
        for (int i = head[u]; i != -1; i = E[i].next)
            if (dis[u] + E[i].l < dis[E[i].v])
            {
                dis[E[i].v] = dis[u] + E[i].l;
                pre[E[i].v] = u;
                if (!vis[E[i].v])
                {
                    vis[E[i].v] = 1;
                    q.push(E[i].v);
                    vcnt[E[i].v]++;
                }
            }
    }
}
int main()///求1~n的最短距离 
{
    int n, m;
    while (cin >> n >> m)
    {
        init(n, m, 1);
        spfa(n, m, 1);
        cout << dis[n] << endl;
    }
    return 0;
}