和Dijkstra算法非常非常像,只有一点点不同,数组d的含义变了,之前是到s的距离,现在是到集合的距离,也是贪心算法。同样可以检测到不连通的情况。
const int maxn = 110;
const int max_int = ~(1<<31);
const int min_int = (1<<31);
bool vis[maxn];
int cost[maxn][maxn], dist[maxn];
//[0,max_int]
int min(int a, int b){
return a < b ? a : b;
}
int prime(int s, int n){
int cnt = 0;
memset(vis, 0, sizeof(vis));
for(int i = 0; i < n; ++i){
dist[i] = max_int;
}
dist[s] = 0;
vis[0] = true;
for(int k = 1; k < n; ++k){
int maxv = max_int, v = -1;
for(int i = 0; i < n; ++i){
if(!vis[i] && d[i] < maxv){
maxv = d[v = i];
}
}
if(-1 == v)return -1;
vis[v] = true;
cnt += d[v];
for(int i = 0; i < n; ++i){
if(!vis[i]){
d[i] = min(d[i], cost[v][i]);
}
}
}
return cnt;
}