Prim(普裡姆)算法適用於求______的網的最小生成樹kruskal(克魯斯卡爾)算法適用於求______的網的最小生成樹【廈門大學 一】
．克魯斯卡爾算法的時間復雜度為______它對______圖較為適合【中科院計算所 二 (分)】
．對於含N個頂點E條邊的無向連通圖利用Prim算法生成最小代價生成樹其時間復雜度為______利用Kruskal算法生成最小代價生成樹其時間復雜度為______【長沙鐵道學院 二 (分)】
．下面描述的是一種構造最小生成樹算法的基本思想設要處理的無向圖包括n個節點VV．．．Vn用相鄰矩陣A表示邊的權全是正數請在下列劃線處填上正確敘述
()．若(ViVj)是邊則A(ij)的值等於______若(ViVj)不是邊則A(ij)的值是一個比任何邊的權______ 矩陣的對角線元素全為
()．構造最小生成樹過程中若節點Vi已包括進生成樹就把相鄰矩陣的對角線元素A(ii)置成______若(ViVj)已包括進生成樹就把矩陣元素A(ij)置成______
()．算法結束時相鄰矩陣中_____的元素指出最小生成樹的_____【山東工業大學二(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23126.html
