数据结构图的邻接矩阵的实现。

包括构造函数、返回边(v1,v2)上的权值的函数、在图的顶点表中插入一个新顶点的函数、在带权图中插入一条边的函数、给出顶点位置为v的第一个邻接顶点的位置的函数、给出顶点v的邻接顶点w的下一个邻接顶点的位置的函数、在图中删除一条边的函数、在图中删除一个指定顶点v, v是顶点号的函数等优质函数。-Data Structure adjacency matrix.

Including the constructor function that returns the edge weights (v1, v2) on the function to insert a new vertex in the vertex list, the insert with the function of an edge in the right of the figure, the position of the vertex v is given first a function of the position of adjacent vertices, the vertex is given a function of the next adjacent vertices adjacent to vertex v w position, a function of deleting an edge in the graph, to remove a specified vertex v in the graph, v is the number of vertices functions such as quality function