Language: C++

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

#define MAX 10000
#define INFTY (1 << 29)

class DisjointSet{
public:
  vector<int> rank, p;

  DisjointSet() {}
  DisjointSet(int size) {
    rank.resize(size, 0);
    p.resize(size, 0);
    for (int i = 0; i < size; i++) {
      makeSet(i);
    }
  }

  void makeSet(int x) {
    p[x] = x;
    rank[x] = 0;
  }

  bool same(int x, int y) {
    return findSet(x) == findSet(y);
  }

  void unite(int x, int y) {
    link(findSet(x), findSet(y));
  }

  void link(int x, int y) {
    if (rank[x] > rank[y]) {
      p[y] = x;
    } else {
      p[x] = y;
      if (rank[x] == rank[y]) {
        rank[y]++;
      }
    }
  }

  int findSet(int x) {
    if (x != p[x]) {
      p[x] = findSet(p[x]);
    }
    return p[x];
  }
};

class Edge {
public:
  int source, target, cost;
  Edge(int source = 0, int target = 0, int cost = 0)
    : soure(source)
    , target(target)
    , cost(cost) {}

  bool operator < (const Edge& e) const {
    return cost < e.cost;
  }
};

int kruskal(int N, vector<edge> edges) {
  int totalCost = 0;
  sort(edges.begin(), edges.end());

  DisjointSet dset = DisjointSet(N + 1);

  for (int i = 0; i < N; i++) {
    dset.makeSet(i);
  }

  int source, target;
  for (int i = 0; i < edge.size(); i++) {
    Edge e = edges[i];
    if (!dset.same(e.source, e.target)) {
      totalCost += e.cost;
      dset.unite(e.source, e.target);
    }
  }
  return totalCost;
}

int main() {
  int N, M, cost;
  int source, target;

  cin >> N >> M;

  vector<Edge> edges;
  for (int i = 0; i < M; i++) {
    cin >> source >> target >> cost;
    edges.push_back(Edge(source, target, cost));
  }

  cout << kruskal(N, edges) << endl;

  return 0;
}


Compiler output:
a.cc: In constructor 'Edge::Edge(int, int, int)':
a.cc:59:7: error: class 'Edge' does not have any field named 'soure'
   59 |     : soure(source)
      |       ^~~~~
a.cc: At global scope:
a.cc:68:27: error: 'edge' was not declared in this scope; did you mean 'Edge'?
   68 | int kruskal(int N, vector<edge> edges) {
      |                           ^~~~
      |                           Edge
a.cc:68:31: error: template argument 1 is invalid
   68 | int kruskal(int N, vector<edge> edges) {
      |                               ^
a.cc:68:31: error: template argument 2 is invalid
a.cc: In function 'int kruskal(int, int)':
a.cc:70:14: error: request for member 'begin' in 'edges', which is of non-class type 'int'
   70 |   sort(edges.begin(), edges.end());
      |              ^~~~~
a.cc:70:29: error: request for member 'end' in 'edges', which is of non-class type 'int'
   70 |   sort(edges.begin(), edges.end());
      |                             ^~~
a.cc:79:23: error: 'edge' was not declared in this scope; did you mean 'Edge'?
   79 |   for (int i = 0; i < edge.size(); i++) {
      |                       ^~~~
      |                       Edge
a.cc:80:19: error: invalid types 'int[int]' for array subscript
   80 |     Edge e = edges[i];
      |                   ^
a.cc: In function 'int main()':
a.cc:101:22: error: cannot convert 'std::vector<Edge>' to 'int'
  101 |   cout << kruskal(N, edges) << endl;
      |                      ^~~~~
      |                      |
      |                      std::vector<Edge>
a.cc:68:33: note:   initializing argument 2 of 'int kruskal(int, int)'
   68 | int kruskal(int N, vector<edge> edges) {
      |                    ~~~~~~~~~~~~~^~~~~