摘要
本文讨论了针对带权连通图的一种可行性存储结构———单链表结构的构造问题 ,并研究了在该结构上构造最小生成树的算法 .
The essay discusses a kind of feasible memory structure orienting to the Connected Graph with Weight—The Problem of the construction of single Linked List Structure. And at the same time it studies the construction of Algrithm of Minimum Cost Spaning Tree on the basis of the very structure.The Agrithm has been realized on the computer.
出处
《赣南师范学院学报》
2001年第3期63-66,共4页
Journal of Gannan Teachers' College(Social Science(2))
关键词
最小生成树
带权连通图
单链表结构
Kruscal算法
Minimum Cost Spaning Tree
Algorithn
Connected Graph with Weight
Single Linked List Structure
