dijkstra邻接表_Dijkstra算法模板

洛谷P4779

个人记录用

代码转自链接：A simple dispiction of dijkstra

侵删

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include<queue>

using namespace std;

///dijkstra算法由优先队列和邻接表两种数据结构组成
///解决的是有向图的最短路径问题

const int MaxN = 100010, MaxM = 500010;

struct edge
{
    int to, dis, next;
};

edge e[MaxM];//边信息
int head[MaxN],dis[MaxN],cnt=0;
bool vis[MaxN];//是否已经确定最优
int n,m,s;

inline void add_edge( int u, int v, int d )
{
    //实现了倒着输入的邻接表。通过head可以检索到所有同起点的边。
    cnt++;//当前正在输入的边的编号
    e[cnt].next = head[u];
    e[cnt].to = v;
    e[cnt].dis = d;
    head[u] = cnt;
}

struct node
{
    int dis;
    int pos;
    bool operator <( const node &x )const
    {
        return x.dis < dis;
    }
};

std::priority_queue<node> q;

inline void dijkstra()
{
    dis[s] = 0;
    q.push( ( node ){0, s} );
    while( !q.empty() )
    {
        node tmp = q.top();
        q.pop();
        int x = tmp.pos, d = tmp.dis;
        if( vis[x] )
            continue;
        vis[x] = 1;
        for( int i = head[x]; i; i = e[i].next )
        {
            int y = e[i].to;
            if( dis[y] > dis[x] + e[i].dis )
            {
                dis[y] = dis[x] + e[i].dis;
                if( !vis[y] )
                {
                    q.push( ( node ){dis[y], y} );
                }
            }
        }
    }
}

int main()
{
    scanf("%d%d%d",&n,&m,&s);
    for(int i = 1; i <= n; ++i)
        dis[i] = 0x7fffffff;//初值无穷大
    for(int i = 0; i < m; ++i )
    {
        int u, v, d;
        scanf( "%d%d%d", &u, &v, &d );
        add_edge( u, v, d );
    }
    dijkstra();
    for( int i = 1; i <= n; i++ )
        printf( "%d ", dis[i] );
    return 0;
}