minCostConnectPoints = (points) => {
    const isBaseCase = ((points.length === 0) || (1000 <= points.length));
    if (isBaseCase) return 0;

    const { graph, seen, minHeap } = buildGraph(points);

    return search(points, graph, seen, minHeap);
}
Prim's algorithm
https://leetcode.com/problems/min-cost-to-connect-all-points/solution/
@param {number[][]} points
@return {number}