[1197] 최소 스패닝 트리 C++

https://www.acmicpc.net/problem/1197

1197번: 최소 스패닝 트리

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

vector<pair<int, pair<int, int>>> vec;
int boss[10001];

int findBoss(int a) {
	if (boss[a] == a)
		return a;
	else
		return boss[a] = findBoss(boss[a]);
}

void setUnion(int a, int b) {
	a = findBoss(a);
	b = findBoss(b);

	if (a != b)
		boss[b] = a;
}


int main() {

	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int V, E;
	cin >> V >> E;

	for (int i = 0; i < E; i++) {
		int a, b, c;
		cin >> a >> b >> c;

		vec.push_back(make_pair(c, make_pair(a, b)));
	}

	sort(vec.begin(), vec.end());

	for (int i = 1; i <= V; i++) {
		boss[i] = i;
	}

	int result = 0;
	for (int i = 0; i < E; i++) {
		int a = vec[i].second.first;
		int b = vec[i].second.second;
		if (findBoss(a) != findBoss(b)) {
			setUnion(a, b);
			result += vec[i].first;
		}
	}

	cout << result;

	return 0;
}