題組內容

6. Consider the graph on the right, answer the following. Indicate the details of every step of the algorithm. (20 pts)

(b) Use Kruskal’s algorithm to find a minimum spanning tree. (必須標示出邊被選擇的順序）