dijkstra 模板

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
int n;
const int maxn = 1e4;
const int inf = 0x3f3f3f3f;
struct node
{
    int x;int d;
    node(){};
    node(int xx,int dd):x(xx),d(dd){};
    bool operator < (const node &a) const
    {
        if(d == a.d) return x < a.x;
        return d > a.d;
    }
};
vector<node>edge[maxn];
int ds[maxn];
bool book[maxn];
void dijkstra(int s)
{
    for(int i = 0;i <= n;i++)
        ds[i] = inf;
        ds[s] = 0;
        memset(book,false,sizeof(book));
        priority_queue<node>q;
        q.push(node(s,ds[s]));
        while(!q.empty())
        {
            node x = q.top();
            q.pop();
            if(book[x.x])
                continue;
            book[x.x] = true;
            for(int i = 0;i < edge[x.x].size();i++)
            {
                node y = edge[x.x][i];
                if(ds[y.x] > x.d + y.d)
                {
                    ds[y.x] = x.d + y.d;
                    q.push(node(y.x,ds[y.x]));
                }
            }
        }
}
int main()
{
    int a,b,d,m;
    while(cin >> n >> m)
    {
        for(int i = 0;i <= n;i++) edge[i].clear();
        while(m--)
        {
            cin >> a >> b >> d;
            edge[a].push_back(node(b,d));
            edge[b].push_back(node(a,d));
        }
        dijkstra(1);
        for(int i = 1;i <= n;i++)
            cout << ds[i] << " ";
    }
    return 0;
}