#include <iostream>
#include<vector>
using namespace std;
int n;//边的数量
const int MAXN = 100;//顶点数量最大范围
vector<pair<int, int>>a[100];//图,记录各条边的顶点和权值
bool check[MAXN];//顶点状态
int priority[MAXN];//每个顶点的优先级
const int IFN = 64;//优先级初始值为无穷
//初始化
void init() {
for (int i = 1; i <=n; i++) {
check[i] = false;
priority[i] = IFN;
}
}
//prim算法
void prim(int start) {
init();
int cur=start;//当前顶点
int length = 0;//最短路的长度
check[start] = true;
priority[start] = 0;
cout << "prim PFS:";
while (1) {
cout << cur << " ";//搜索顺序
//遍历当前顶点的邻居,更新优先级
for (unsigned i = 0; i < a[cur].size(); i++) {
if (!check[a[cur][i].first]) {
if (priority[a[cur][i].first] > a[cur][i].second)
priority[a[cur][i].first] = a[cur][i].second;
}
}
//找下一个开始搜索的点
for (int min=IFN,i = 1; i <= n; i++) {
if (!check[i]) {
if (min > priority[i]) {
min = priority[i];
cur = i;
}
}
}
if (check[cur])
break;//当所有点搜索完毕时,结束循环
check[cur] = true;
length += priority[cur];
}
cout << endl;
cout << "length:" << length;
}
int main()
{
cin >> n;//边数
int x,y,w;//边的端点和权值
for (int i = 1; i <=n; i++) {
cin >> x>>y>>w;
a[x].push_back(make_pair(y, w));
a[y].push_back(make_pair(x, w));
}
prim(1);
return 0;
}
运行结果: