prim 보다 kruskal1

• MnimumSpanningTree (Kruskal+Disjoint_set(UnionFind) Union find package AlgorithmFoundation.Minimum_Spanning_Tree; public class UnionFind_Test { static int parent[]=new int[9]; public static void main(String[] args) { // 초기화 과정 for (int i = 1; i x) parent[y]=x; else parent[x]=y; } } public static boolean inSameParent(int x,int y) { x=find(x); y=find(y); if(x==y) { return true; } return false; } public static int find(int x) { if(parent[x]==x) retu.. Algorithm/AlgorihmFoundation 2020. 12. 15.