．有向圖的鄰接表存儲如下()．畫出其鄰接矩陣存儲()．寫出圖的所有強連通分量()．寫出頂點a到頂點i的全部簡單路徑【東北大學 一 (分)】
．試用下列三種表示法畫出網G 的存儲結構並評述這三種表示法的優缺點
()．鄰接矩陣表示法; ()．鄰接表表示法; ()．其它表示法【華中理工大學 三(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23118.html
