编写程序以邻接矩阵、邻接表两种方式存储指定连通图，并输出存储之后的图。
用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。(The program stores the designated connected graphs in two ways of adjacency matrix and adjacency list, and outputs the graph after storage.
Using depth first and breadth first algorithm to traverse the graph stored in the adjacency matrix and the graph stored in the adjacency list.)