This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.

 
  • 本文以鄰接矩陣作為圖的存儲結構,指出如何在計算機上實(shí)現克魯斯卡爾算法,并分析所設計算法的時(shí)間復雜度。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan