．已知頂點和輸入邊與權值的序列(如右圖所示)每行三個數表示一條邊的兩個端點和其權值共行請你
()．采用鄰接多重表表示該無向網用類PASCAL語言描述該數據結構畫出存儲結構示意圖要求符合在邊結點鏈表頭部插入的算法和輸入序列的次序
()．分別寫出從頂點出發的深度優先和廣度優先遍歷頂點序列以及相應的生成樹
()．按prim算法列表計算從頂點始求最小生成樹並圖示該樹【北京工業大學 四(分)】
．下圖表示一個地區的通訊網邊表示城市間的通訊線路邊上的權表示架設線路花費的代價如何選擇能溝通每個城市且總代價最省的n條線路畫出所有可能的選擇【東北大學一(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23109.html
