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.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
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这样的小型计算机(没有外存贮器)能处理大量的版图数据。
In computer science, the way information is organized in the memory of a computer is called a data structure.
在计算机科学中，信息在计算机存储器中的组织方式被称为数据结构。
应用推荐