有一個用於n個頂點連通帶權無向圖的算法描述如下
()．設集合T與T初始均為空
()．在連通圖上任選一點加入T
()．以下步驟重復n次
a在i屬於Tj不屬於T的邊中選最小權的邊
b該邊加入T
上述算法完成後T中共有______條邊該算法稱______算法T中的邊構成圖的______【南京理工大學 二 (分)】
有向圖G可拓撲排序的判別條件是______【長沙鐵道學院 二(分)】
Dijkstra最短路徑算法從源點到其余各頂點的最短路徑的路徑長度按______次序依次產生該算法弧上的權出現______情況時不能正確產生最短路徑【南京理工大學 二(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23127.html
