说明：  能够输入输出一个图的邻接矩阵，能够对相应的边和顶点进行插入删除操作，能够进行深度和广度优先搜索遍历
(The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal)