．請回答下列關於圖(Graph)的一些問題(每題分)
()．有n個頂點的有向強連通圖最多有多少條邊?最少有多少條邊?
()．表示有個頂點l條邊的有向圖的鄰接矩陣有多少個矩陣元素？是否稀疏矩陣？
()．對於一個有向圖不用拓撲排序如何判斷圖中是否存在環？【清華大學一(分)】
．解答問題設有數據邏輯結構為
B = (K R) K = {k k … k}
R={<k k> <k k> <k k><k k> <k k> <k k><k k> <k k> <k k> <k k> <k k>}
()．畫出這個邏輯結構的圖示(分)
()．相對於關系r 指出所有的開始接點和終端結點(分)
()．分別對關系r中的開始結點舉出一個拓撲序列的例子(分)
()．分別畫出該邏輯結構的正向鄰接表和逆向鄰接表(分)【山東工業大學 三 (分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23117.html
