一無向圖G(VE)其中V(G)={}E(G)={()()()()()()()()}對該圖從頂點開始進行遍歷去掉遍歷中未走過的邊得一生成樹G(VE)V(G)=V(G)E(G)={()()()()()()}則采用的遍歷方法是______【南京理工大學 三 (分)】
為了實現圖的廣度優先搜索除了一個標志數組標志已訪問的圖的結點外還需______存放被訪問的結點以實現遍歷【南京理工大學 二 (分)】
按下圖所示畫出它的廣度優先生成樹______和深度優先生成樹______【西安電子科技大學 三 (分)】
．構造連通網最小生成樹的兩個典型算法是______【北京科技大學 一】
．求圖的最小生成樹有兩種算法______算法適合於求稀疏圖的最小生成樹【南京理工大學 二(分)】
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []
From:http://tw.wingwit.com/Article/program/sjjg/201311/23125.html
