．下面的鄰接表表示一個給定的無向圖
()給出從頂點v開始對圖G用深度優先搜索法進行遍歷時的頂點序列
()給出從頂點v開始對圖G用廣度優先搜索法進行遍歷時的頂點序列【復旦大學六(分))
．給出圖G
()．畫出G的鄰接表表示圖
()．根據你畫出的鄰接表以頂點①為根畫出G的深度優先生成樹和廣度優先生成樹【南開大學 五 (分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23120.html
