摘要
数据结构是计算机科学的算法理论基础和软件设计的技术基础,在计算机领域中有着举足轻重的作用。本文以邻接矩阵作为图的存储结构,指出如何在计算机上实现克鲁斯卡尔算法,并分析所设计算法的时间复杂度。
The data structure is the foundation of computer algorithm theory and software design technology, and plays an important role in the computer field. 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.
出处
《电脑知识与技术》
2005年第4期3-4,共2页
Computer Knowledge and Technology
