Advertisement
Guest User

Untitled

a guest
Nov 22nd, 2019
85
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.48 KB | None | 0 0
  1.  28 vector<pair<int,ii>> mst(int n,
  2.  29         vector<pair<int,ii>> edges) {
  3.  30     union_find uf(n);
  4.  31     sort(edges.begin(), edges.end());
  5.  32     vector<pair<int, ii>> res;
  6.  33     rep(i,0,edges.size())
  7.  34         if (uf.find(edges[i].second.first) !=
  8.  35             uf.find(edges[i].second.second)) {
  9.  36             res.push_back(edges[i]);
  10.  37             uf.unite(edges[i].second.first,
  11.  38                      edges[i].second.second); }
  12.  39     return res; }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement