最小生成树_Kruskal算法

/*
6 9
0 1 34
0 5 19
0 2 46
2 5 25
2 3 17
5 3 25
5 4 26
3 4 38
1 4 12
*/
/*
5 7
0 1 10
1 2 50
3 2 20
2 4 10
3 4 60
0 3 30
0 4 100
*/

#include "stdafx.h"
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

int n, m;
int map[50][50] = { 0 };
class EdgeNode
{
public:
	int from, to, weight;
};
EdgeNode EdgeList[50];
int parent[50];

bool compare(EdgeNode a, EdgeNode b)
{
	if (a.weight < b.weight)return 1;
	return 0;
}

void create()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> EdgeList[i].from >> EdgeList[i].to >> EdgeList[i].weight;
	}
	sort(EdgeList, EdgeList + m, compare);
}

int FindRoot(int a)
{
	if (parent[a] == -1)return a;
	else FindRoot(parent[a]);
}

void Kruskal()//!!
{
	for (int i = 0; i < n; i++)
	{
		parent[i] = -1;
	}
	int num = 0;
	for (int i = 0; i < m; i++)
	{
		int p = FindRoot(EdgeList[i].from);
		int q = FindRoot(EdgeList[i].to);
		if (p != q)
		{
			cout << EdgeList[i].from << EdgeList[i].to << EdgeList[i].weight << endl;
			parent[q] = p;
			num++;
			if (num == m - 1)break;
		}
	}
}
int main()
{
	create();
	Kruskal();
}