最小生成树基础算法

前提：并查集

struct Node {
  // u -> v 值为 w
  int u, v, w;

  Node() {}

  Node(int a, int b, int c) {
    u = a, v = b, w = c;
  }

  friend bool operator < (Node a, Node b) {
    return a.w > b.w;
  }
};

// 预处理时f[i] = i
int _find(int x) {
  return f[x] = (f[x] == x ? x : _find(f[x]));
}

1 Kruskal算法

int kruskal() {
  int sum = 0;
  priority_queue<Node> q;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (edge[i][j])
        q.push(Node(i, j, edge[i][j]));
  while (!q.empty()) {
    Node ft = q.top();
    q.pop();
    int fu = _find(ft.u);
    int fv = _find(ft.v);
    if (fu != fv) { // 该边被选
      f[fu] = fv;
      sum += ft.w;
    }
  }
  return sum;
}

2 Prim

int prim() {
  int sum = 0;
  priority_queue<Node> q;
  vis[1] = true;
  for (int i = 1; i <= n; i++)
    if (edge[1][i])
      q.push(Node(1, i, edge[1][i]));
  while (!q.empty()) {
    Node ft = q.top();
    q.pop();
    if (!vis[ft.v]) {
      sum += ft.w;
      vis[ft.v] = true;
      for (int i = 1; i <= n; i++)
        if (edge[ft.v][i])
          q.push(Node(ft.v, i, edge[ft.v][i]));
    }
  }
  return sum;
}