Prim

#include <cstdio>
const int MAXN = 1000;
const int INF = 1000000000;
int n, G[MAXN][MAXN];
int d[MAXN]; //顶点到集合s的最短距离
bool vis[MAXN];
int prim() { //类似于Dijkstra
	fill(d, d + MAXN, INF);
	d[0] = 0;
	int ans = 0;
	for(int i=0; i<n; i++) {
		int u = -1, MIN = INF;
		for(int j=0; j<n; j++) {
			if(d[j] < MIN) {
				MIN = d[j];
				u = j;
			}
		}
		if(u == -1) return;
		vis[u] = true;
		ans += d[u];
		for(int v=0; v<n; v++) {
			if(vis[v] == false && G[u][v] != INF && G[u][v] < d[v]) {
			//以u为中介可以使v离集合s更近
				d[v] = G[u][v];
			}
		}
	}
	return ans;
}