Dijkstra

dijkstra.cpp

vector<array<int, 2>> adj[MAXN];
int dist[MAXN];
void dijkstra(int start) {
    fill(begin(dist), end(dist), INF);
    priority_queue<array<int, 2>, vector<array<int,2>>, greater<array<int, 2>>> pq;
    pq.push({0, start});
    while (!pq.empty()) {
        auto t = pq.top();
        pq.pop();
        if (dist[t[1]] <= t[0])
            continue;
        dist[t[1]] = t[0];
        for (auto i : adj[t[1]])
            pq.push({t[0] + i[0], i[1]});
    }
}