．設無向網G 如
()． 設頂點abcdefh的序號分別為請列出網G的鄰接矩陣畫出網G 的鄰接表結構:
()．寫出從頂點a出發按深度優先搜索和廣度優先搜索方法遍歷網G所的到的頂點序列
按Prim算法求出網G的一棵最小生成樹【北京科技大學 五 (分)】
．有一圖的鄰接矩陣如下試給出用弗洛伊德算法求各點間最短距離的矩陣序列AAAA【北京郵電大學四(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23110.html
