1、定义邻接矩阵存储的图类Graph_Matrix .
2、实验验证如下算法的正确性、各种功能及指标：
1）创建一个邻接矩阵存储的图；
2）返回图中指定边的权值；
3）查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号；
3、4）图的深度优先遍历；
5）基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix.
2. The experiment verifies the correctness of the following algorithms, various functions and indicators.
1) create a graph of adjacency matrix storage.
2) return map refers to the weight of dingbian;
3) find the first adjacency vertex of a vertex in a graph, and the next vertex sequence number of one vertex on another vertex;
3, 4) the depth first traversal of the graph;
5) prim algorithm for minimum spanning tree based on. [selected])