．當一個有N個頂點的圖用鄰接矩陣A表示時頂點Vi的度是( )【南京理工大學一(分)】
．用相鄰矩陣A表示圖判定任意兩個頂點Vi和Vj之間是否有長度為m 的路徑相連則只要檢查( )的第i行第j列的元素是否為零即可【武漢大學 二】
A．mA B．A C．Am D．Am
下列說法不正確的是( )【青島大學 二 (分)】
A．圖的遍歷是從給定的源點出發每一個頂點僅被訪問一次 B．遍歷的基本算法有兩種深度遍歷和廣度遍歷 C．圖的深度遍歷不適用於有向 D．圖的深度遍歷是一個遞歸過程
．無向圖G=(VE)其中V={abcdef}E={(ab)(ae)(ac)(be)(cf)(fd)(ed)}對該圖進行深度優先遍歷得到的頂點序列正確的是( )【南京理工大學 一 (分)】
A．abecdf B．acfebd C．aebcfd D．aedfcb
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23146.html
