用邻接矩阵存取图的顶点信息，在其存储结构上实现图的基本操作（添加，删除顶点与弧）-With access to the vertex adjacency matrix of information in its storage structure to achieve the basic graph operations (add, delete vertices and arcs.) .