文件名称:6
介绍说明－－下载内容均来自于网络，请自行研究使用
1）掌握普里姆构造最小生成树算法的数据结构和算法实现；
2）掌握图或网的邻接矩阵表示及其上基本算法的实现；
3）按照实验题目要求独立完成实验内容（提交程序清单及相关实验数据与运行结果）；
4）认真书写实验报告,并按时提交。
-1) grasp the prim construct minimum spanning tree algorithm for data structure and algorithm 2) master plan or a network and its adjacency matrix express the realization of the basic algorithm 3) In accordance with the requirements of the experiment the subject independently completed the experiment content (to submit the list of procedures and related experimental data and results) 4) the experiment seriously written report and submitted on time.
2）掌握图或网的邻接矩阵表示及其上基本算法的实现；
3）按照实验题目要求独立完成实验内容（提交程序清单及相关实验数据与运行结果）；
4）认真书写实验报告,并按时提交。
-1) grasp the prim construct minimum spanning tree algorithm for data structure and algorithm 2) master plan or a network and its adjacency matrix express the realization of the basic algorithm 3) In accordance with the requirements of the experiment the subject independently completed the experiment content (to submit the list of procedures and related experimental data and results) 4) the experiment seriously written report and submitted on time.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
6.doc