<p>You are given an array <code>points</code> representing integer coordinates of some points on a 2D-plane, where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>.</p>

<p>The cost of connecting two points <code>[x<sub>i</sub>, y<sub>i</sub>]</code> and <code>[x<sub>j</sub>, y<sub>j</sub>]</code> is the <strong>manhattan distance</strong> between them: <code>|x<sub>i</sub> - x<sub>j</sub>| + |y<sub>i</sub> - y<sub>j</sub>|</code>, where <code>|val|</code> denotes the absolute value of <code>val</code>.</p>

<p>Return <em>the minimum cost to make all points connected.</em> All points are connected if there is <strong>exactly one</strong> simple path between any two points.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/26/d.png" style="width: 214px; height: 268px;" />
<pre>
<strong>Input:</strong> points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
<strong>Output:</strong> 20
<strong>Explanation:</strong> 
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/26/c.png" style="width: 214px; height: 268px;" />
We can connect the points as shown above to get the minimum cost of 20.
Notice that there is a unique path between every pair of points.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> points = [[3,12],[-2,5],[-4,1]]
<strong>Output:</strong> 18
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 1000</code></li>
	<li><code>-10<sup>6</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>6</sup></code></li>
	<li>All pairs <code>(x<sub>i</sub>, y<sub>i</sub>)</code> are distinct.</li>
</ul>

class GraphData {

    public: 
    int x;
    int y;
    int pos;
    int dist;
    GraphData(int x, int y, int pos, int dist){
        this->x = x;
        this->y = y;
        this->pos = pos;
        this->dist = dist;
    }
};

class Compare{
    public: 
    bool operator()(pair<GraphData*, int> a, pair<GraphData*, int> b){
        return a.first->dist > b.first->dist;
    }
};


class Solution {
public:
    int minCostConnectPoints(vector<vector<int>>& points) {

        vector<vector<GraphData>> graph;

        for(int i=0; i<points.size(); i++){
            vector<GraphData> tempData;
            for(int j=0; j<points.size(); j++){
                if(i == j){
                    continue;
                }
                int dist = abs(points[i][0] - points[j][0]) + abs(points[i][1] - points[j][1]);
                GraphData graphData(points[j][0], points[j][1], j, dist);
                tempData.push_back(graphData);
            }
            graph.push_back(tempData);
        }

        priority_queue<pair<GraphData*, int>, vector<pair<GraphData*, int>>, Compare> pq;
        vector<bool> visited(points.size(), false);

        GraphData* g1 = new GraphData(points[0][0],points[0][1],0, 0);
        pq.push({g1, 0});
        // visited[0] = true;
        int minCost = 0;
        int i = 0;

        while(pq.size()!=0){
            GraphData* currNode = pq.top().first;
            int cost = pq.top().second;
            pq.pop();
            
            if(visited[currNode->pos]){
                continue;
            }
            cout<<currNode->dist<<" - "<<currNode->pos<<endl;
            minCost += currNode->dist;

            visited[currNode->pos] = true;
            
            // Get the minimum of this
            for(int i=0; i<graph[currNode->pos].size(); i++){
                GraphData node = graph[currNode->pos][i];
                if(!visited[node.pos]){
                    pq.push({&graph[currNode->pos][i], minCost + graph[currNode->pos][i].dist});
                }
            }
        }

        return minCost;

    }
};
301785