用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output

用邻接矩阵实现图的基本操作：创建，销毁，增删修改顶点，增删弧或边，DFS，BFS等-Graph with adjacency matrix to achieve basic operations: create, destroy, modify vertex deletions, additions and deletions arcs or edges, DFS, BFS, etc.