| 3 | int n; union_find uf; |
| 4 | vector<vector<pair<ii,int> > > adj; |
| 5 | arborescence(int _n) : n(_n), uf(n), adj(n) { } |
| 6 | void add_edge(int a, int b, int c) { |
| 7 | adj[b].push_back(make_pair(ii(a,b),c)); } |
| 8 | vii find_min(int r) { |
nothing calls this directly
no outgoing calls
no test coverage detected