Function kruskal

graph/code15.cpp:65–107

}

void kruskal(vector<pair<int, int>> vec[], int v)
{
    vector<int> arr(v), rank(v, 0);
    for (int i = 0; i < v; i++)
    {
        arr[i] = i;
    }
    vector<node> nodes;
    for (int i = 0; i < v; i++)
    {
        int curr = i;
        for (int j = 0; j < vec[curr].size(); j++)
        {
            int adj = vec[curr][j].first;
            int adj_weight = vec[curr][j].second;

            nodes.push_back({curr, adj, adj_weight});
        }
    }
    sort(nodes.begin(), nodes.end(), mycomp);

    int mini_weight = 0;

    for (int i = 0; i < nodes.size(); i++)
    {
        node curr = nodes[i];
        int find_first = find(arr, curr.u);
        int find_sec = find(arr, curr.v);

        if (find_first == find_sec)
        {
            continue;
        }
        else
        {
            make_union(arr, rank, curr.u, curr.v);
            cout << "Connected Edge: " << curr.u << " " << curr.v << " " << curr.weight << endl;
            mini_weight += curr.weight;
        }
    }

    cout << "Minimum Spanning Tree weight: " << mini_weight << endl;
}

int main()
{