．已知無向圖如下所示
()．給出從V開始的廣度優先搜索序列()．畫出它的鄰接表
()．畫出從V開始深度優先搜索生成樹【燕山大學 五 (分)】
第題圖 第題圖
．已知某圖的鄰接表為
()．寫出此鄰接表對應的鄰接矩陣(分)
()．寫出由v開始的深度優先遍歷的序列(分)
()．寫出由v開始的深度優先的生成樹(分)
()．寫出由v開始的廣度優先遍歷的序列(分)
()．寫出由v開始的廣度優先的生成樹(分)
()．寫出將無向圖的鄰接表轉換成鄰接矩陣的算法(分) 【山東大學 六分】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23123.html
