．對於如下的加權有向圖給出算法Dijkstra產生的最短路徑的支撐樹設頂點A為源點並寫出生成過程【吉林大學 一 (分)】
．已知圖的鄰接矩陣為
當用鄰接表作為圖的存儲結構且鄰接表都按序號從大到小排序時試寫出
()．以頂點V為出發點的唯一的深度優先遍歷
()．以頂點V為出發點的唯一的廣度優先遍歷
()．該圖唯一的拓撲有序序列【同濟大學 一 (分 )】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23092.html
