Function dijstra2

graph/code16.cpp:68–105

with priority queue

// with priority queue
void dijstra2(vector<pair<int, int>> vec[], int v, int source)
{
    vector<int> dist(v, INT_MAX);
    vector<bool> mst(v, false);

    dist[source] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, mycmp> pq;
    pq.push({source, 0});

    for (int i = 0; i < v; i++)
    {
        while (pq.empty() == false && mst[pq.top().first] == true)
        {
            pq.pop();
        }

        pair<int, int> curr = pq.top();
        pq.pop();

        for (int j = 0; j < vec[curr.first].size(); j++)
        {
            int adjacent = vec[curr.first][j].first;
            int adj_weight = vec[curr.first][j].second;

            if (mst[adjacent] == false && dist[adjacent] > dist[curr.first] + adj_weight)
            {
                dist[adjacent] = dist[curr.first] + adj_weight;
                pq.push({adjacent, dist[adjacent]});
            }
        }
    }
    cout << "Minimum distances(priority queue) are: " << endl;
    for (int i = 0; i < dist.size(); i++)
    {
        cout << dist[i] << " ";
    }
    cout << endl;
}

int main()
{