阿摩線上測驗
登入
阿摩線上測驗
登入
4. Consider a weighted graph (the edges show the costs) as follows. Please use the Kruskal Algorithm to get the corresponding minimum (cost) spanning tree. Not only the result but also the whole procedure steps should be presented in your answer.