Prim

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 510;
const int INF = 0x3fffffff;

int n, m, G[N][N];
int d[N];
bool vis[N] = {false};
int path[N];

int Prim(int s) {
	int ans = 0;
	fill(path, path + N, -1);
	fill(d, d + N, INF);
	d[s] = 0;
	
	for (int i = 0; i < n; i++) {
		int u = -1, MIN = INF;
		for (int j = 0; j < n; j++) {
			if (!vis[j] && d[j] < MIN) {
				MIN = d[j];
				u = j;
			} 
		}
		
		if (u == -1) return -1;
		vis[u] = true;
		ans += d[u];
		
		for (int v = 0; v < n; v++) {
			if (!vis[v] && G[u][v] != INF && d[v] > G[u][v]) {
				d[v] = G[u][v];
				path[u] = v;
			}
		}
	}
	
	return ans;
}

int main() {
	int u, v, w;
	
	scanf("%d %d", &n, &m);
	fill(G[0], G[0] + N * N, INF);
	for (int i = 0; i < m; i++) {
		scanf("%d %d %d", &u, &v, &w);
		G[u][v] = G[v][u] = w;
	}
	
	int ans = Prim(0);
	printf("%d\n", ans);

	return 0;
}

/***********************
6 10
0 1 4
0 4 1
0 5 2
1 2 6
1 5 3
2 3 6
2 5 5
3 4 4
3 5 5
4 5 3
输出：15 
***********************/