起初找任意一个点作为初始点,成为其他所有点的前置点并且更新dis数组,并将这个点放入集合内(vis标记),然后找到所有点到其前置点最短的那个,线段即为局部最优加入到sum内,线段终点也加入到集合里,然后遍历所有不在集合内的点,如果遍历到的点到它前置点的距离大于到线段终点的距离,就将线段终点作为其前置点并更新dis数组,依次进行就是非优先队列版的prim算法。
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 105;
const int inf = 0x3f3f3f3f;
int Map[maxn][maxn];
int dis[maxn];
int bgn;
void init(int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) {
Map[i][j] = 0;
} else {
Map[i][j] = inf;
}
}
}
}
void read(int m) {
int u, v, w;
for (int i = 0; i < m; i++) {
scanf("%d %d %d", &u, &v, &w);
Map[u][v] = Map[v][u] = w;
bgn = u;
}
}
int prim(int n) {
int ans = 0;
bool vis[maxn];
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if(i == bgn){
continue;
}
dis[i] = Map[bgn][i];
}
dis[bgn] = 0;
vis[bgn] = true;
for (int i = 1; i <= n; i++) {
if(i == bgn){
continue;
}
int min_dis = inf, k;
for (int j = 1; j <= n; j++) {
if (!vis[j] && min_dis > dis[j]) {
min_dis = dis[j];
k = j;
}
}
if (min_dis == inf) {
return -1;
}
ans += min_dis;
vis[k] = true;
for (int j = 1; j <= n; j++) {
if (!vis[j] && dis[j] > Map[k][j]) {
dis[j] = Map[k][j];
}
}
}
return ans;
}
int main() {
int T, n, m;
scanf("%d", &T);
while (T--) {
scanf("%d %d", &n, &m);
init(n);
read(m);
printf("%d\n", prim(n));
}
return 0;
}