数据输入:
第一行是2个整数,分别表示顶点个数n和边数m。接下来的m行中,每一行第一个整
数表示边的开始顶点,第二个表示边的结束顶点,第三个表示这条边的权重。
(
测试数据中保证图是连通图;
没有自环;
两个顶点之间只有一条边;
0<权重<100(可以相等);n<=50; m<=1000;
)
结果输出:
输出无向连通图最小生成树权重之和
输入示例:
6 10
1 2 6
1 3 1
1 4 5
2 3 5
2 5 3
3 4 5
3 5 6
3 6 4
4 6 2
5 6 6
输出示例:
15
#include<iostream>
#include<vector>
using namespace std;
void mst(vector<int> &arr, vector<int> &brr, vector<vector<int>>&oldmap, vector<vector<int>>&newmap)
{
int minbegin, minend;
int minweight = 100000;
for (int i = 0; i < arr.size(); i++)
{
for (int j = 0; j < brr.size(); j++)
{
if ((oldmap[arr[i] - 1][brr[j] - 1] < minweight) && (oldmap[arr[i] - 1][brr[j] - 1] != 0))
{
minbegin = arr[i];
minend = brr[j];
minweight = oldmap[arr[i] - 1][brr[j] - 1];
}
}
}
arr.push_back(minend);
for (vector<int>::iterator it = brr.begin(); it <= brr.end(); it++)
{
if (*it == minend)
{
brr.erase(it);
break;
}
}
newmap[minbegin - 1][minend - 1] = oldmap[minbegin - 1][minend - 1];
newmap[minend - 1][minbegin - 1] = oldmap[minend - 1][minbegin - 1];
}
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>>oldmap(50); //定义二维数组50*1000
vector<vector<int>>newmap(50);
for (int i = 0; i < 50; i++)
{
oldmap[i].resize(1000);
newmap[i].resize(1000);
}
for (int i = 0; i < n; i++)
{
//初始所有边权重都是0
for (int j = 0; j < n; j++)
{
oldmap[i][j] = 0;
newmap[i][j] = 0;
}
}
for (int i = 0; i < m; i++)
{
int p1, p2, pw; //分别是起点,终点,权重
cin >> p1 >> p2 >> pw;
oldmap[p1 - 1][p2 - 1] = pw;
oldmap[p2 - 1][p1 - 1] = pw;
}
vector<int> arr;
vector<int> brr;
arr.push_back(1);
for (int i = 2; i <= n; i++)brr.push_back(i);
while (arr.size() != n)
{
mst(arr, brr, oldmap, newmap); //prim算法
}
int sum = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
sum += newmap[i][j];
}
}
cout << sum/2 ;
}