問題詳情
7. Given the following weighted graph, show the order in which the edges are added to the minimnum costspanning tree using Kruskal's algorithm. (Use weight to represent edges in your answer and just show theorder.)
7. Given the following weighted graph, show the order in which the edges are added to the minimnum costspanning tree using Kruskal's algorithm. (Use weight to represent edges in your answer and just show theorder.)