克鲁斯卡尔算法思想.cpp

int seekedge(EDGE * (&a), int n)

void bubble(EDGE * (&a), int size)

void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边

void storepicture(EDGE * (&a), int n, VERTEX *b, int m) -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)