数据结构实验:用邻接表存储，并按Kruskal算法求最小生成树

#include"AdjListDirNetwork.h" #include"Assistance.h" #include"Kruskal.h" #include"Assistance.h" int main(void) { try { int infity = DEFAULT_INFINITY; char vexs[] = { 'A', 'B', 'C', 'D', 'E', 'F' }; int m[6][6] = { {0, 6, 3, 5, infity, infity}, {6, 0, infity, 1, 5, infity}, {3, infity, 0, 6, infity, 6}, {5, 1, 6, 0, 5, 4}, {infity, 5, infity, 5, 0, 2}, {infity, infity, 6, 4, 2, 0} }; int n = 6; AdjListDirNetwork<char, int>net(vexs, n);//vextable=vexs,vexNum=n for (int v = 0; v < n; v++) for (int u = 0; u < n; u++) if (m[v][u] != infity&&v!=u) net.InsertArc(v, u, m[v][u]); cout << "显示有向网：" << endl; if (net.IsEmpty()) cout << "该有向网为空！" << endl; else net.Display(); cout << "Kruskal算法产生最小生成树的边：" << endl; MiniSpanTreeKruskal(net); cout << endl; } catch (Error err) { err.Show(); } system("PAUSE"); return 0; }