Dijkstra-std.cpp

#include <bits/stdc++.h>
using namespace std;
struct node
{
    int dis;
    int pos;
    bool operator>(const node &x) const
    {
        return x.dis > dis;
    }
};
struct edge
{
    int v;
    int w;
};
vector<edge> connects[100001];
vector<int> dist(100001);
vector<bool> visit(100001);
priority_queue<node> q;
void priority_dijstra(int start)
{
    q.push((node){0, start});
    while (!q.empty())
    {
        int dis = q.top().dis;
        int pos = q.top().pos;
        q.pop();
        if (visit[pos])
            continue;
        visit[pos] = true;
        for (auto con : connects[pos])
        {
            if (dist[con.v] > dist[pos] + con.w)
            {
                dist[con.v] = dist[pos] + con.w;
                q.push((node{dist[con.v],con.v}));
            }
        }
    }
}