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.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
Computer memory is an important system resources, any procedures data and the control data structure must occupy some storage space.
存储器是计算机系统的重要资源之一，任何程序、数据和各控制数据结构都必须占用一定的存储空间。
The data structure is so designed that it enables a minicomputer without an external memory, such as a DJS-130 computer, to handle the vast data of mask graph.
其数据结构使得像DJS - 130这样的小型计算机(没有外存贮器)能处理大量的版图数据。
应用推荐