最小生成树之Kruskal算法
说明
Kruskal算法的find函数由边决定,时间复杂度为O(log e),而外面有一个for循环e次,所以Kruskal算法得时间复杂度为O(e * log e),适合求边稀疏的网的最小生成树
代码
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INFINITY 65535
#define maxSize 50
#define OK 1
typedef int VertexType;
typedef int EdgeType;
typedef struct
{
VertexType vexs[maxSize];
EdgeType arc[maxSize][maxSize];
int n, e;
}MGraph;
typedef struct
{
int begin, end, weight;
}Edge;
bool cmp(Edge a, Edge b)
{
if (a.weight != b.weight)
{
return a.weight < b.weight;
}
return a.begin < b.begin;
}
int find(int parent[], int f)
{
while (parent[f] > 0)
{
f = parent[f];
}
return f;
}
void Kruskal(MGraph &G)
{
int i, n, m;
Edge edges[maxSize];
int parent[maxSize];
cin >> G.n >> G.e;
for (i = 1; i <= G.e; i++)
{
cin >> edges[i].begin >> edges[i].end >> edges[i].weight;
}
sort(edges + 1, edges + 1 + G.e, cmp);
for (i = 1; i <= G.n; i++)
{
parent[i] = 0;
}
for (i = 1; i <= G.e; i++)
{
n = find(parent, edges[i].begin);
m = find(parent, edges[i].end);
if (n != m)
{
parent[n] = m;
printf("(%d %d) %d\n",edges[i].begin, edges[i].end, edges[i].weight);
}
}
}
int main()
{
MGraph G;
Kruskal(G);
return 0;
}
后记
在Kruskal算法函数中的判断“n != m”是因为若n与m相等则表示最后起点和终点为同一个点故形成了环路
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
Output
1 3 1
4 6 2
2 5 3
3 6 4
1 4 5
2 3 5
3 4 5
1 2 6
3 5 6
5 6 6
(1 3) 1
(4 6) 2
(2 5) 3
(3 6) 4
(2 3) 5
输入图例
输出图例