这是数据库变成中的基础内容，利用这一功能解决一些大矩阵的存储以及运算-This is the basis of the contents of the database becomes, the use of this feature to solve some of the large matrix of storage and computing

用c语言编写的实现用邻接矩阵存储,最小生成树普里姆算法,最小生成树克鲁斯卡尔算法 -With c languages using adjacency matrix storage, minimum spanning tree Primbetov algorithm, minimum spanning tree algorithm Kruskal