Description: Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m)
To Search:
File list (Check if you may need any files):
Kruskal
.......\克鲁斯卡尔算法思想.cpp
.......\克鲁斯卡尔算法思想.cpp.bak
.......\克鲁斯卡尔算法思想.exe
.......\克鲁斯卡尔算法思想.obj
Download