4. Kruskal’s algorithm builds a minimum cost spanning tree T by adding edges to T one at a time. The following is Kruskal’s algorithm and the original graph with weighted values. Show the minimum cost spanning tree T by means of Kruskal’s algorithm. (10%)

6. The pseudo program is shown in the following. (20%) void program (item a[], item b[]) #define MAX_TERMS 100 int n,i,j,temp; typedef struct { n = a[0].valueC; int valueA; b[0].valueA = a[0].valueB; int valueB; b[0].valueB = a[0].valueA; int valueC; b[0].valueC = n; } item; if (n > 0) item a[MAX_TERMS], temp = 1; b[MAX_TERMS]; for (i = 0; i < a[0].valueB; i++) for (j = 1; j

4. Kruskal’s algorithm builds a minimum cost spanning tree T by
adding edges to T one at a time. The following is Kruskal’s
algorithm and the original graph with weighted values. Show the
minimum cost spanning tree T by means of Kruskal’s algorithm.
(10%)

相關申論題

相關試卷