path: root/graph/kruskal.cpp

sort(edges.begin(), edges.end());
vector<edge> mst;
int cost = 0;
for (edge& e : edges) {
	if (findSet(e.from) != findSet(e.to)) {
		unionSets(e.from, e.to);
		mst.push_back(e);
		cost += e.cost;
}}