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.

 
  • 本文以邻接矩阵作为图的存储结构,指出如何在计算机上实现克鲁斯卡尔算法,并分析所设计算法的时间复杂度。
今日热词
目录 附录 查词历史