本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
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 structure of this granulator includes computer automatic inspection and control system which has the functions of data storage and analysis, thus, the machine is high automatically controlled.
为了在计算机的存储器中实现堆栈结构，习惯上保留一个足够大的连续的存储单元，以适应堆栈，因为它的生长和收缩。
To implement a stack structure in a computer's memory, it is customary to reserve a block of contiguous memory cells large enough to accommodate the stack as it grows and shrinks.
应用推荐