國立臺灣大學資訊工程學系Chao, Kun-MaoKun-MaoChao趙坤茂2006-09-282018-07-052006-09-282018-07-05http://ntur.lib.ntu.edu.tw//handle/246246/2006092815521389A minimum spanning tree (MST) of a weighted graph G is a spanning tree of G whose edges sum to minimum weight. In other words, a minimum spanning tree is a tree formed from a subset of the edges in a given undirected graph, with two properties: it spans the graph, i.e., it includes every vertex in the graph, and it is a minimum, i.e., the total weight of all the edges is as low as possible.application/ppt484352 bytesapplication/vnd.ms-powerpointzh-TWlearning objecthttp://ntur.lib.ntu.edu.tw/bitstream/246246/2006092815521389/1/mst.ppt