．下圖所示是一帶權有向圖的鄰接表法存儲表示其中出邊表中的每個結點均含有三個字段依次為邊的另一個頂點在頂點表中的序號邊上的權值和指向下一個邊結點的指針試求
()．該帶權有向圖的圖形
()．從頂點V為起點的廣度優先周游的頂點序列及對應的生成樹(即支撐樹)
()．以頂點V為起點的深度優先周游生成樹
()．由頂點V到頂點V的最短路徑【中山大學 四 (分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23111.html
