1）掌握图的邻接矩阵存储结构表示和与图创建算法的c语言实现；

2）掌握普里姆（Prim）最小生成树算法(P174:算法7.9)的C语言实现及应用；

3）验证如下图5-1所示无向网的最小生成树的正确性

4）按照实验题目要求独立正确地完成实验内容（提交程序清单及相关实验数据与运行结果）；



-1) The master plan of the adjacency matrix and the storage structure that plans to create algorithm c language　2) master prim (Prim) Minimum Spanning Tree Algorithm (P174: Algorithm 7.9) of the C language and application　3) the certification is as follows shown in Figure 5-1 undirected minimum spanning tree network, the accuracy of 4) in accordance with the experimental subject for independent completion of the experiment the contents of the right (to submit the list of procedures and related experimental data and results)