．求出下圖中頂點到其余各頂點的最短路徑【廈門大學 八 (分)】
．試利用Dijkstra算法求下圖中從頂點a到其他個頂點間的最短路徑寫出執行算法過程中各步的狀態【東南大學 四(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23113.html
