@[quyy06](/user/477737)
```cpp
void kruskal(){
for(int i=1;i<=mn;i++){
int un=find(a[i].u),vn=find(a[i].v);
if(un==vn) continue;
fa[vn]=un;
num=max(num,a[i].w);
++cnt;
//if(cnt==n-1) return; 这里写错了，树的数量是m
if(cnt==m-1) return;
}
}
```
by Ninelife_Cat @ 2021-08-13 10:15:29
@[Ninelife_Cat](/user/329672) 哦哦，谢谢谢谢
by quyy06 @ 2021-08-13 10:17:58
才发现，十分感谢
by lizicheng3042 @ 2023-06-24 15:35:18