Prim - (ACM学习笔记)

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 1e4 + 5;
int dis[maxn], book[maxn];
int cost[maxn][maxn];
int n;
int prim() {
	for (int i = 0; i < n; i++) {
		dis[i] = INF; book[i] = 0;
	}
	dis[0] = 0;
	int res = 0;
	while (1) {
		int v = -1;
		for (int u = 0; u < n; u++)
			if (!book[u] && (v == -1 || dis[u] < dis[v])) v = u;
		if (v == -1) break;
		book[v] = 1;
		res += dis[v];
		for (int u = 0; u < n; u++) {
			dis[u] = min(dis[u], cost[v][u]);
		}
	}
	return res;
}