说明：  1）掌握普里姆构造最小生成树算法的数据结构和算法实现； 2）掌握图或网的邻接矩阵表示及其上基本算法的实现；
(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 )