如何使用聯合查找,最小堆,克魯斯卡爾算法和排序算法來創建最小成本生成樹? (C ++) [英]How to use union-find, minheap, Kruskal's, and a sort algorithm to create a minimum cost spanning tree? (C++)