#include <iostream>
using namespace std;
#define MAXVALUE 100000
//顶点以1为最小点
//保存数组中以0为最小点
void kruskal(int** graph, int vertices) {
int length = vertices, foundV = 0, run = 0;
//set用于记录每个顶点属于哪个集合
//若1,2顶点的边被选中,则1,2同属于1集合,即顶点靠前的集合
//若所有顶点都同属于一个集合,则表示图已连通
int* set = new int[length];
for (int i = 0; i < length; i++)
{
set[i] = i;
}
bool finished = false;
while (!finished) {
finished = true;
//edge_a是位置靠前的顶点,edge_b是位置靠后的顶点
int minEgde = MAXVALUE, edge_a = 0, edge_b = 0;
for (int i = 0; i < length; i++)
{
for (int j = i + 1; j < length; j++)
{
//如果两点都已找到或不存在该边 则什么都不做
if ((set[i] == set[j]) || graph[i][j] == 0);
else {
if (graph[i][j] < minEgde) {
minEgde = graph[i][j];
edge_a = i;
edge_b = j;
}
}
}
}
int seta = set[edge_a], setb = set[edge_b];
//把同一集合的所有顶点加入另一个位置靠前的顶点的集合
if (seta < setb) {
for (int i = 0; i < length; i++)
{
if (set[i] == setb) {
set[i] = seta;
}
}
}
else {
for (int i = 0; i < length; i++)
{
if (set[i] == seta) {
set[i] = setb;
}
}
}
//如果所有点都放到集合1中,则表示图已连通
for (int i = 0; i < length; i++)
{
if (set[i] != 0) {
finished = false;
break;
}
}
cout << ++run << ' ' << edge_a + 1 << "->" << edge_b + 1 << ':' << minEgde << endl;
}
delete []set;
}
最小生成树-Kruskal
最新推荐文章于 2022-04-13 09:36:23 发布