．已知無向圖GV(G)={}E(G)={()()()()()}試畫出G的鄰接多表並說明若已知點I如何根據鄰接多表找到與I相鄰的點j？【東南大學 一 (分) 一(分)】
．如何對有向圖中的頂點號重新安排可使得該圖的鄰接矩陣中所有的都集中到對角線以上？【清華大學 一 (分)】
．假定Ｇ＝(VE)是有向圖V＝｛．．．N｝N＞＝G以鄰接矩陣方式存儲G的鄰接矩陣為A即Ａ是一個二維數組如果i到j有邊則A[ij]=否則A[ij]=請給出一個算法該算法能判斷G是否是非循環圖(即G中是否存在回路)要求算法的時間復雜性為O(n*n)【吉林大學 三(分)】
． 首先將如下圖所示的無向圖給出其存儲結構的鄰接鏈表表示然後寫出對其分別進行深度廣度優先遍歷的結果【天津大學 一】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23119.html
