．已知一圖如下圖所示
()．寫出該圖的鄰接矩陣
()．寫出全部拓撲排序
()．以v為源點以v為終點給出所有事件允許發生的最早時間和最晚時間並給出關鍵路徑
()．求V結點到各點的最短距離【北京郵電大學 五 (分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23093.html
