gfg-minimum-spanning-tree-(prims-algorithm).cpp

class Solution
{
public:
  // Function to find sum of weights of edges of the Minimum Spanning Tree.
  int spanningTree(int V, vector<vector<int>> adj[])
  {
    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        pq;
    vector<int> vis(V, 0);
    pq.push({0, 0});
    int sum = 0;
    while (!pq.empty())
    {
      auto it = pq.top();
      pq.pop();
      int wt = it.first;
      int node = it.second;
      if (vis[node] == 1)
        continue;
      vis[node] = 1;
      sum += wt;
      for (auto i : adj[node])
      {
        int adjnode = i[0];
        int edW = i[1];
        if (!vis[adjnode])
        {
          pq.push({edW, adjnode});
        }
      }
    }
    return sum;
  }
};