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%)

相關申論題

相關試卷