．已知一個無向圖如下圖所示要求分別用Prim和Kruskal算法生成最小樹(假設以①為起點試畫出構造過程)【哈爾濱工業大學 九 (分)】
．G=(VE)是一個帶有權的連通圖則
()．請回答什麼是G的最小生成樹
()．G為下圖所示請找出G的所有最小生成樹【北方交通大學 二 (分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23105.html
